Lara Schenck

Lover of programming, maker of monsters

Category: Monsters

One of my favorite past times is drawing friendly monsters.

My medium of choice is the iPad / Apple pencil combo in Keynote for easy use in slides and printing in stickers, but monsters are not picky about where and how they appear.

  • Researching Headless WordPress:
    The head stays on…for now.

    I have a new project coming up that is the perfect opportunity to refine my WordPress process. Building the site as a “headless CMS” and finally digging into React was at the top of my mind, but after some research, I’ve decided the head will stay on.

  • Thoughts on Gutenberg (Post-WordCamp US)

    A follow up to my pre-WordCamp post about hesitations regarding Gutenberg. Blocks are the future, and I’m excited! Gutenberg and blocks will change the web, or at least 30% of it.

  • Image of Gutenberg editor

    Thoughts on Gutenberg (Pre-WordCamp US)

    This post has been marinating in my drafts for a few weeks, and I’d like to get it out into the world before I learn a whole bunch through talks and conversations at WordCamp US this weekend and refine my views accordingly.

  • Advocating for Accessible UI Design

    Although it is a hot topic in our industry, accessibility is not just up to developers! In this article I wrote for CSS-Tricks, I go through several non-technical accessibility tips developers can share with designers and content providers in order to advocate for accessible UI design on teams.

  • Advocating for Accessible UI Design [on CSS-Tricks]

    A few tips for accessible UI design you can share among your designer and product colleagues. Originally published on CSS-Tricks.

  • Day 6: Algorithms – Sorting Algorithms in JavaScript

    Algorithms have got a bad, scary, rap. And you know what? It’s for good reason – understanding an algorithm is pretty doable, but implementing an algorithm in code of your own? It’s hard. I went through writing some common sorting algorithms in JavaScript with lots of help from the Internet. Take a read!

  • Calculating the binary search runs for 1000 items

    Day 5: Algorithms – Logarithms, Big-O, & Binary Search

    If I told my 16-year-old, art student self I’d be writing a blog post about logarithms, I wouldn’t have believed it. I’ve tried hard to avoid math for much of my life, yet here I am, not only learning about it but enjoying it! This post is an outline of what logarithms are and how…

  • A diagram of a hash table if people's names

    Day 4: Data Structures – I Made a Hash Table

    Apart from hashtags, my association with hashes is encrypting passwords in a database. That association is correct in terms of what a hash is, but there are also hash tables, hash functions, hash maps, and oh my gosh, more hash things for sure. Let’s focus on a hash function and a hash table and building…

  • Day 3: Data Structures – Stacks & Queues

    Stacks and queues are quite similar in that they are both linear and abstract data structures (meaning they describe the behavior of a different data structure, like a linked list or array). All the action in terms of adding and removing items happens at their ends, and their main difference is in which end that…

  • Drawing of a tree data structure

    Day 2: Data Structures – Trees!

    Day 2 of Data Structures…let’s talk about trees! What is a binary tree versus a binary search tree? Isn’t the DOM a tree? All of this and more!

  • Illustration of a linked list

    Day 1: Data Structures – Linked Lists

    Linked lists are very similar to arrays in that they are a one-dimensional list of elements. Unlike arrays, however, in a linked list, you cannot just jump to index 4, you have to walk through the list, starting with the “head”, or the first element in the list, and work your way through to the…

  • Computer Science Bootcamp

    I’m studying up for a real-deal interview. There will be whiteboards. There will be coding questions much more involved than FizzBuzz. There will be algorithms and math and data structures and all of the things I have successfully avoided for much of my career. This is potentially a dream job, and if I put the…