cheatsheet1999 / FrontEndCollection
- среда, 27 октября 2021 г. в 00:29:50
Notes for Front-end Software Engineers. Covers common data structure and algorithms, basic web concepts, HTML & CSS & Javascript.
1. What happens when you type in a URL
2. GET vs POST
3. What can we do to improve a website's performance?
4. HTML5 offline storage mechanism
5. Common time and space-complexity
6. What has been deprecated, and what is new on HTML5?
7. How the DOM really works?
8. Inline elements, Block elements, and what are the differences?
9. Several ways to call a function
10. A brief introduction of the differences between "src" and "href"
11. A brief introduction of Call, Apply, Bind
12. Time and space complexity for common sorting algorithm
1. What is the difference between display:none and visibility:hidden style?
2. What is BFC(Block Formatting Context)
1. Accordion
2. ModalBox
3. Drum Kit
4. Mini Clock
5. Playing with Variables
1. Implement Curry()
2. implement Array.prototype.flat()
3. Implement curry() with placeholder support
Two Sum
Binary Search
Search Insert Position
Squares of a Sorted Array
Move Zeros
Reverse Linked List
Rotate Array
Meeting Rooms II
Intersection of Two Arrays II
Remove Nth Node From End of List
K Closest Points to Origin
Container With Most Water
Trapping Rain Water
Product of Array Except Self
Merge Intervals
Longest Consecutive Sequence
Coin Change
Gas Station
Top K Frequent Elements
3 Sum
Count Binary Substrings
Word Search
Subarray Sum Equals K
Subdomain Visit Count
Next Permutation
Expressive Words
Search in Rotated Sorted Array
Verifying an Alien Dictionary
4Sum(nSum universal solution)
3Sum Closest
Jump Game
Jump Game II
Minimum Size Subarray Sum
Valid Parentheses
Longest Common Prefix
Valid Palindrome II
Longest Substring Without Repeating Characters
Letter Combinations of a Phone Number
Minimum Remove to Make Valid Parentheses
Generate Parentheses
Decode String
Longest Palindromic Substring
Time Based Key-Value Store
Roman to Integer
Longest String Chain
Robot Bounded In Circle
Word Break
Binary Tree Preorder Traversal
Binary Tree Inorder Traversal
Construct Binary Tree from Preorder and Inorder Traversal
Invert Binary Tree
Unit 2 Exploring Databases and SQL
ER diagram, Relational Algebra, SQL / NOSQL
Unit 3: Data Storage
Unit 4: Data Indexing
Unit 5: Transactions and Recovery
Unit 6: Concurrency
Unit 1 - 6 Practice Questions Solutions