Why I Wrote This Book Who This Book Is For Why Is This Book Front-End Focused? Interview Process Recruiter Phone Interview Read up on the role and the company ahead of time Be on time Have two or three questions prepared to ask the recruiter Thank them for their time Coding Challenge
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function iterate(arr, findMe) { | |
if (arr[0]) { | |
if(arr[0] === findMe) { | |
return true; | |
} | |
} | |
if (arr[1]) { | |
if (arr[1] === findMe) { | |
return true; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Replace this... | |
cd Desktop/my-folder/another-folder | |
yarn build:dev:my-really-cool-project:watch | |
// With this... | |
runApp | |
// By creating an alias | |
// Open the .bashrc or .zshrc file | |
open -e . .zshrc |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
.hidden-visually { | |
position: absolute; | |
width: 1px; | |
height: 1px; | |
margin: -1px; | |
padding: 0; | |
border: 0; | |
overflow: hidden; | |
clip: rect(0 0 0 0); | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
HTML | |
- Semantic HTML | |
- Event delegation | |
- Accessibility / ARIA | |
CSS | |
- Specificity | |
- Pseudo-elements | |
- Pseudo-selectors | |
- Combinators |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Data Structures | |
- Stacks | |
- Queues | |
- Linked lists | |
- Graphs | |
- Trees | |
- Tries | |
Concepts | |
- Big O Notation |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function flattenArr(arr) { | |
let flattenedArr = []; | |
function flatten(subArr) { | |
for (let i of subArr) { | |
if (Array.isArray(i)) { | |
flatten(i); | |
continue; | |
} | |
flattenedArr.push(i); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
export default class Stack { | |
constructor() { | |
this.stack = []; | |
} | |
push(item) { | |
this.stack.push(item); | |
} | |
pop() { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function uniteUnique(...arr) { | |
let flatArray = arr.flat(); | |
const set = new Set(flatArray); | |
return Array.from(set); | |
} | |
uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function fearNotLetter(str) { | |
let letters = str.split(''); | |
let startingCharCode = letters[0].charCodeAt(0); | |
let endingCharCode = letters[letters.length-1].charCodeAt(0); | |
// Find the current sum of char codes | |
let currentTotalCharCodes = letters.reduce((total, letter) => total += letter.charCodeAt(0), 0); | |
// Find the expected sum of char codes | |
let expectedTotalCharCodes = 0; |
NewerOlder