English | MP4 | AVC 1280×720 | AAC 48KHz 2ch | 0h 40m | 135 MB
As a JavaScript developer vying for a new position, you may encounter tricky interview questions that test you on topics you may not have encountered in the real world. In this practical course, instructor Leigh Lawhon shows how to build a portfolio piece that addresses some of the common interview questions on arrays, sorting algorithms, and optimizing code performance. Prepare for your next technical interview as you boost your understanding of key concepts, such as the insertion sort and merge sort algorithms, as well as how to create your own algorithms. Throughout the course, Leigh shares how to best communicate your knowledge when faced with tough questions.
Topics include:
- Sorting your table efficiently
- Filtering null values and sorting nodes
- Sorting algorithms, including merge sort and insertion sort
- Performance testing
- Creating your own algorithm
- Design components
- Adding icons
Table of Contents
Introduction
1 Build up your JavaScript portfolio
2 What you should know
Getting Started
3 Using this project in interviews
4 Tools
Sorting Our Table Efficiently
5 Sort algorithm
6 Regular sort method
7 Node list
8 Filter null values
9 Sorting nodes
Sorting Algorithms
10 Overview of sorting algorithms
11 Intro to bubble sort
12 Bubble sort
13 Intro to merge sort
14 Merge sort
15 Intro to insertion sort
16 Insertion sort
17 Performance testing
Creating Our Own Algorithm
18 Intro to quartile sorter
19 Push values into header array
20 Quartile min max and mean
21 Nodes
22 Bucketing into quartiles
Design
23 Design components
24 Adding icons
Conclusion
25 Next steps
Resolve the captcha to access the links!