Ask HN: How to prepare for a Front-end Developer interview?

Post by insin » Mon, Aug 15, 2016, 12:08 PM UTC

patrickdavey wrote: post #119

bzalasky wrote: post #67

Generally, I start by getting an idea of how well a candidate understands JavaScript with a problem like this: Write a function that enables the following API... createOlympian() .name('Katie Ledecky') .sport('Swimming') .country('USA') .log() // Katie Ledecky, Swimming, USA Next, if things are going well, I have the candidate transform a JSON collection response to match some arbitrary requirements using Lodash/Unde…

Pointers on how to improve this (while maintaining your API) would be great :) var createOlympian = function() { return (function() { var attrs = []; // private variable for our olympian attributes var olympian = { name: function(name){ attrs['name'] = name; return this; }, sport: function(sport) { attrs['sport'] = sport; return this; }, country: function(country) { attrs['country'] = country; return this; }, log: fu…

    function createOlympian() {
      let props =  ['name', 'sport', 'country']
      let olympian = {
        log() {
          console.log(props.map(prop => this[prop]).join(', '))
        }
      }
      props.forEach(prop => {
        olympian[prop] = function(value) {
          this[prop] = value
          return this
        }
      })
      return olympian
    }

Post by ricardobeat » Mon, Aug 15, 2016, 12:41 PM UTC

danyim wrote: post #66

ricardobeat wrote: post #61

Earlier quoted context omitted.

Try writing that same thing without ES6.

I'm also in the process of interviewing for a front-end engineer position, so thank you for replying and providing feedback. I'm assuming it has to be written this way because the function being pushed was referencing i, which was within the scope of the closure. Turning it into an IIFE breaks out of that. Thoughts? // Assuming pre-ES6 function iterate(k) { var funcs = []; for(var i = 0; i

Post by epimetheus » Mon, Aug 15, 2016, 1:20 PM UTC

zeven7 wrote: post #85

danyim wrote: post #58

Earlier quoted context omitted.

Would that exercise be the following? I'm not sure I understand what's being tested. const f = (k) => { const funcs = []; for(let i = 0; i i); } return funcs; } const test = f(4); console.log(test[0]()); // 0 console.log(test[1]()); // 1 console.log(test[2]()); // 2 console.log(test[3]()); // 3

Tip: You can stick to `const` when declaring `i` in the loop header (at least as far as the ES spec is concerned -- mileage may vary on current implementations / transpilers).

Post by jonahx » Mon, Aug 15, 2016, 2:15 PM UTC

nilkn wrote: post #93

jonahx wrote: post #12

Earlier quoted context omitted.

> Even for a front-end developer you should have a basic knowledge of data structures like linked lists, binary trees, min/max heaps, depth/breadth first search, tries, recursion, hash tables, etc. I would never care about these if I was specifically hiring a front-end dev. I've never once seen any of them come up in the context of front-end work in my entire career. And in fact an interviewer asking questions about…

I'm confused. You've never even seen a hash table come up before? What sort of front-end work are you doing? I just find this extremely unlikely if not borderline impossible. Hash tables are one of the most universal data structures in practical software development. This is just as true in JavaScript for front-end work as it is anywhere else.

Post by MatmaRex » Mon, Aug 15, 2016, 2:40 PM UTC

nilkn wrote: post #94

MatmaRex wrote: post #77

Earlier quoted context omitted.

Depth-first and breadth-first graph traversal does come up. Example: you're implementing a task tracking system, where tasks can have dependencies. Boom, that's a graph. You want to display a whole graph of dependencies of a task (and dependencies of dependencies, etc.). Boom, there's graph traversal. You need to limit the number of tasks displayed in that graph, because someone added a thousand dependencies somewher…

> Now, about most of the other things that were mentioned… I'm not convinced. Your graph example could just as well also be a tree example depending on the structure of the dependencies. Hash tables show up everywhere. Recursion is a natural and general programming technique. That only leaves linked lists, tries, and heaps from the original list. I'd agree that these are less likely to pop up in general front-end dev…