Notes for Front-end Software Engineers. Covers common data structure and algorithms, basic web concepts, HTML & CSS & Javascript.
# FrontEndCollection (Keep updating everyday, hopefully...)

## Web Development Basics
### HTML 📖
[1. What happens when you type in a URL](https://github.com/cheatsheet1999/FrontEndCollection/issues/2)  
[2. GET vs POST](https://github.com/cheatsheet1999/FrontEndCollection/issues/4)  
<a href="https://github.com/cheatsheet1999/FrontEndCollection/issues/5">3. What can we do to improve a website's performance?</a>  
<a href="https://github.com/cheatsheet1999/FrontEndCollection/issues/6">4. HTML5 offline storage mechanism</a>  
[5. Common time and space-complexity](https://github.com/cheatsheet1999/FrontEndCollection/issues/9)  
[6. What has been deprecated, and what is new on HTML5?](https://github.com/cheatsheet1999/FrontEndCollection/issues/11)  
[7. How the DOM really works?](https://github.com/cheatsheet1999/FrontEndCollection/issues/18)  
[8. Inline elements, Block elements, and what are the differences?](https://github.com/cheatsheet1999/FrontEndCollection/issues/27)  
[9. Several ways to call a function](https://github.com/cheatsheet1999/FrontEndCollection/issues/28)  
[10. A brief introduction of the differences between "src" and "href"](https://github.com/cheatsheet1999/FrontEndCollection/issues/29)  
[11. A brief introduction of Call, Apply, Bind](https://github.com/cheatsheet1999/FrontEndCollection/issues/30)  
[12. Time and space complexity for common sorting algorithm](https://github.com/cheatsheet1999/FrontEndCollection/issues/9)  

### CSS 💎
[1. What is the difference between display:none and visibility:hidden style?](https://github.com/cheatsheet1999/FrontEndCollection/issues/37)  
[2. What is BFC(Block Formatting Context)](https://github.com/cheatsheet1999/FrontEndCollection/issues/38)

### JavaScript Concepts 📦
[`this` keyword](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/Web-Note/%60this%60%20keyword.md)   
[Bubbling and Capturing](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/Web-Note/Bubbling%20and%20Capturing.md)   
[Execution Context](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/Web-Note/Execution%20Context.md)   
[Higher Order Function](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/Web-Note/Functions%20%26%20Callbacks.md)      
[Event Loop](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/Web-Note/Single%20Thread,%20Event%20Loop%20&%20Blocking%20Code.md)      
[Closures](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/Web-Note/Closures.md)   
[Throttling and Debouncing](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/Web-Note/Throttling%20and%20Debouncing.md)   
[Promises](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/Web-Note/Promises.md)    

### JavaScript Demos 🖥
[Consuming Promises](https://github.com/cheatsheet1999/FrontEndCollection/tree/main/JS-Day/Consuming%20Promises)     

### React Concepts 💡   
[Controlled Components](https://github.com/cheatsheet1999/FrontEndCollection/tree/main/Web-Note/Controlled%20Components)   

### React Projects (In ascending order of difficulty)
[ExpenseTracker](https://github.com/cheatsheet1999/FrontEndCollection/tree/main/React/ExpenseTracker)        

### Node.js Demos 🟢
[Receive input](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Day/Receive%20input/preview.md)     
  
## Projects
[1. Accordion](https://github.com/cheatsheet1999/FrontEndCollection/issues/17)   
[2. ModalBox](https://github.com/cheatsheet1999/FrontEndCollection/issues/23)  
[3. Drum Kit](https://github.com/cheatsheet1999/FrontEndCollection/tree/main/JS-Day/DrumKit)  
[4. Mini Clock](https://github.com/cheatsheet1999/FrontEndCollection/tree/main/JS-Day/Mini%20Clock)  
[5. Playing with Variables](https://github.com/siyuan25/FrontEndCollection/tree/main/JS-Day/Playing%20with%20Variables)  

## Deep Dive in Javascript 
[_Learn More on BFE.dev_](https://bigfrontend.dev/)  

[1. Implement Curry()](https://github.com/cheatsheet1999/FrontEndCollection/issues/33)   
[2. implement Array.prototype.flat()](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Core/implement%20Array.prototype.flat().md)  
[3. Implement curry() with placeholder support](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Core/implement%20curry()%20with%20placeholder%20support.md)  

## Data Structures & Algorithms in JavaScript

### Solve the questions on [Codewar](https://www.codewars.com/) if you are a beginner
[Beginners](https://github.com/cheatsheet1999/FrontEndCollection/tree/main/JS-Algo/Beginners)   

<details>
<summary><strong>Array</strong></summary>


[0001. Two Sum](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0001.%20Two%20Sum.md)           
[Two Sum II - Input Array Is Sorted](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted.md)   
[0011. Container With Most Water](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0011.%20Container%20With%20Most%20Water.md)      
[0026. Remove Duplicates from Sorted Array.md](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0026.%20Remove%20Duplicates%20from%20Sorted%20Array.md)        
[Search Insert Position](https://github.com/cheatsheet1999/FrontEndCollection/issues/26)  
[Squares of a Sorted Array](https://github.com/cheatsheet1999/FrontEndCollection/issues/31)        
[Last and Second Last](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Last%20and%20Second%20Last.md)  
[Rotate Array](https://github.com/cheatsheet1999/FrontEndCollection/issues/32)  
[Meeting Rooms II](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Meeting%20Rooms%20II.md)  
[Intersection of Two Arrays II](https://github.com/cheatsheet1999/FrontEndCollection/issues/36)  
[Remove Nth Node From End of List](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Remove%20Nth%20Node%20From%20End%20of%20List.md)  
[K Closest Points to Origin](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/K%20Closest%20Points%20to%20Origin.md) 
[Maximum Subarray](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Maximum%20Subarray.md)        
[Best Time to Buy and Sell Stock](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Best%20Time%20to%20Buy%20and%20Sell%20Stock.md)  
[First Bad Version](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/First%20Bad%20Version.md)    
[Meeting Rooms](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Meeting%20Rooms.md)   
[Trapping Rain Water](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Trapping%20Rain%20Water.md)  
[Product of Array Except Self](https://github.com/cheatsheet1999/FrontEndCollection/issues/1)  
[Merge Intervals](https://github.com/cheatsheet1999/FrontEndCollection/issues/3)   
[Longest Consecutive Sequence](https://github.com/cheatsheet1999/FrontEndCollection/issues/7)  
[Spiral Matrix](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Spiral%20Matrix.md)     
[Coin Change](https://github.com/cheatsheet1999/FrontEndCollection/issues/13)  
[Gas Station](https://github.com/cheatsheet1999/FrontEndCollection/issues/15)  
[Top K Frequent Elements](https://github.com/cheatsheet1999/FrontEndCollection/issues/19)  
[3 Sum](https://github.com/cheatsheet1999/FrontEndCollection/issues/20)  
[Count Binary Substrings](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Count%20Binary%20Substrings.md)  
[Word Search](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Word%20Search.md)  
[Subarray Sum Equals K](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Subarray%20Sum%20Equals%20K.md)  
[Subdomain Visit Count](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Subdomain%20Visit%20Count.md)  
[Next Permutation](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Next%20Permutation.md)  
[Expressive Words](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Expressive%20Words.md)   
[Verifying an Alien Dictionary](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Verifying%20an%20Alien%20Dictionary.md)  
[4Sum(nSum universal solution)](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/4Sum.md)  
[3Sum Closest](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/3Sum%20Closest.md)   
[Jump Game](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Jump%20Game.md)   
[Jump Game II](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Jump%20Game%20II.md)    
[Minimum Size Subarray Sum](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Minimum%20Size%20Subarray%20Sum.md)   
[Matrix Summation](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Matrix%20Summation.md)  
[Counting Analogous Arrays](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Counting%20Analogous%20Arrays.md)  
[Custom Sorted Array](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Custom%20Sorted%20Array.md)         
[Reformat Date](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Reformat%20Date.md)          
[Game of Life](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Game%20of%20Life.md)        
[Search a 2D Matrix II](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Search%20a%202D%20Matrix%20II.md)     
[Kth Largest Element in an Array](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Kth%20Largest%20Element%20in%20an%20Array.md)     
[Insert Delete GetRandom O(1)](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Insert%20Delete%20GetRandom%20O(1).md)     
[Reaching Points](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Reaching%20Points.md)     
[Pow(x, n)](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Pow(x%2C%20n).md)    
[Sum of Square Numbers](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Sum%20of%20Square%20Numbers.md)     
[Minimum Moves to Equal Array Elements](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Minimum%20Moves%20to%20Equal%20Array%20Elements.md)
[Buying Show Tickets](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Buying%20Show%20Tickets.md)     
[Count Duplicate Elements](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Count%20Duplicate%20Elements.md)   
[Password Creation](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Password%20Creation.md)  

</details>
 
 
 
<details>
<summary><strong>Two Pointers</strong></summary>
  
[0015. 3Sum](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0015.%203Sum.md)           
[0016. 3Sum Closest](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0016.%203Sum%20Closest.md)
[0283. Move Zeroes](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0283.%20Move%20Zeroes.md)

</details>
 

<details>
<summary><strong>String</strong></summary>

<ul>
<details>
<summary>Palindrome</summary>

[0005. Longest Palindromic Substring](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0005.%20Longest%20Palindromic%20Substring.md).            
[0009. Palindrome Number](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0009.%20Palindrome%20Number.md)       
  
</details>
</ul>


<ul>
<details>
  <summary> Uncategorized </summary>

[0006. Zigzag Conversion](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0006.%20Zigzag%20Conversion.md)    
[0007. Reverse Integer](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0007.%20Reverse%20Integer.md)      
[0014. Longest Common Prefix](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0014.%20Longest%20Common%20Prefix.md)       
[Reverse String](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Reverse%20String.md)    
[Reverse Words in a String III](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Reverse%20Words%20in%20a%20String%20III.md)      
[Longest Common Prefix](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Longest%20Common%20Prefix.md)    
[Valid Palindrome II](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Valid%20Palindrome%20II.md)     
[Longest Substring Without Repeating Characters](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Longest%20Substring%20Without%20Repeating%20Characters.md)   
[Letter Combinations of a Phone Number](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Letter%20Combinations%20of%20a%20Phone%20Number.md)   
[Generate Parentheses](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Generate%20Parentheses.md)   
[Decode String](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Decode%20String.md)   
[Longest Palindromic Substring](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Longest%20Palindromic%20Substring.md)   
[Time Based Key-Value Store](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Time%20Based%20Key-Value%20Store.md)  
[Longest String Chain](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Longest%20String%20Chain.md)  
[Robot Bounded In Circle](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Robot%20Bounded%20In%20Circle.md)  
[Word Break](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Word%20Break.md)    
[Minimum Number of Steps to Make Two Strings Anagram](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram.md)      
[Reorganize String](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Reorganize%20String.md)    
[Group Anagrams](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Group%20Anagrams.md)    
[Shortest Word Distance II](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Shortest%20Word%20Distance%20II.md)          
[Simplify Path](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Simplify%20Path.md)       
[Search Suggestions System](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Search%20Suggestions%20System.md)           
[Remove All Adjacent Duplicates in String II](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Remove%20All%20Adjacent%20Duplicates%20in%20String%20II.md)      
[Fraction to Recurring Decimal](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Fraction%20to%20Recurring%20Decimal.md)     
[Accounts Merge](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Accounts%20Merge.md)     
[Longest Happy String](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Longest%20Happy%20String.md)    
[Minimum Deletions to Make Character Frequencies Unique](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique.md)     
 
</details>
</ul>



</details>

<details>
<summary><strong>Stack</strong></summary>

[Buildings With an Ocean View](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Buildings%20With%20an%20Ocean%20View.md)    
[Valid Parentheses](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Valid%20Parentheses.md)    
[Minimum Remove to Make Valid Parentheses](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Minimum%20Remove%20to%20Make%20Valid%20Parentheses.md)  

</details>

<details>
<summary><strong>Map</strong></summary>
  
[0560. Subarray Sum Equals K](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0560.%20Subarray%20Sum%20Equals%20K.md)
  
</details>

<details>
<summary><strong>Set</strong></summary>
  
[0003. Longest Substring Without Repeating Characters](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0003.%20Longest%20Substring%20Without%20Repeating%20Characters.md)     
  
</details>


<details>
<summary><strong>Object Manipulation</strong></summary>
 
[0012. Integer to Roman](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0012.%20Integer%20to%20Roman.md)      
[0013. Roman to Integer](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0013.%20Roman%20to%20Integer.md)           
  
</details>


<details>
<summary><strong>Linked-List </strong></summary>  
  
[0002. Add Two Numbers](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/0002.%20Add%20Two%20Numbers.md)    
[206. Reverse Linked List](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/206.%20Reverse%20Linked%20List.md)     
[Linked List Cycle](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Linked%20List%20Cycle.md)   
[Middle of the Linked List](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Middle%20of%20the%20Linked%20List.md)    
[Linked List Cycle II](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Linked%20List%20Cycle%20II.md)   
[Add Two Numbers](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Add%20Two%20Numbers.md)  
[Design Linked List](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Design%20Linked%20List.md)        
[LRU Cache](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/LRU%20Cache.md)   

</details>
</ul>

<details>
<summary><strong>Tree</strong></summary>

<ul>
<details>
  <summary> ⭐ </summary>

[Binary Tree Preorder Traversal](https://github.com/cheatsheet1999/FrontEndCollection/issues/21)  
[Binary Tree Inorder Traversal](https://github.com/cheatsheet1999/FrontEndCollection/issues/22)  

</details>
</ul>

<ul>
<details>
  <summary> ⭐⭐ </summary>
  
[Construct Binary Tree from Preorder and Inorder Traversal](https://github.com/cheatsheet1999/FrontEndCollection/issues/8)  
[Invert Binary Tree](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Invert%20Binary%20Tree.md)     
[Lowest Common Ancestor of a Binary Tree](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree.md)        
[Recover Binary Search Tree](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Recover%20Binary%20Search%20Tree.md)    

</details>
</ul>

<ul>
<details>
  <summary> ⭐⭐⭐ </summary>
  
[Range Sum of BST](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Range%20Sum%20of%20BST.md)    
[Binary Tree Vertical Order Traversal](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Binary%20Tree%20Vertical%20Order%20Traversal.md)   
[Validate Binary Search Tree](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Validate%20Binary%20Search%20Tree.md)     
[Sum Root to Leaf Numbers](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Sum%20Root%20to%20Leaf%20Numbers.md)       
[Binary Tree Right Side View](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Binary%20Tree%20Right%20Side%20View.md)  

</details>
</ul>

</details>

<details>
<summary><strong>Recursion & Backtracking</strong></summary>

[Combinations](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Combinations.md)   

</details>


<details>
<summary><strong>BFS & DFS</strong></summary>

[Flood Fill](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Flood%20Fill.md)       
[Max Area of Island](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Max%20Area%20of%20Island.md)     
[Merge Two Binary Trees](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Merge%20Two%20Binary%20Trees.md)     
[Populating Next Right Pointers in Each Node](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Populating%20Next%20Right%20Pointers%20in%20Each%20Node.md)         
[01 Matrix](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/01%20Matrix.md)   
[Rotting Oranges](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Rotting%20Oranges.md)   
[Number of Islands](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Number%20of%20Islands.md)    
[Minimum Knight Moves](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Minimum%20Knight%20Moves.md)     

</details>

<details>
<summary><strong>Binary Search</strong></summary>

[Binary Search](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Binary%20Search.md)    
[Find First and Last Position of Element in Sorted Array](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array.md)     
[Search in Rotated Sorted Array](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Search%20in%20Rotated%20Sorted%20Array.md)   
[Find Peak Element](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Find%20Peak%20Element.md)

</details>

<details>
<summary><strong>Database Management</strong></summary>
  
[Unit 2 Exploring Databases and SQL](https://github.com/cheatsheet1999/FrontEndCollection/issues/45)   
[ER diagram, Relational Algebra, SQL / NOSQL](https://github.com/cheatsheet1999/FrontEndCollection/issues/14)     
[Unit 3: Data Storage](https://github.com/cheatsheet1999/FrontEndCollection/issues/43)     
[Unit 4: Data Indexing](https://github.com/cheatsheet1999/FrontEndCollection/issues/35)     
[Unit 5: Transactions and Recovery](https://github.com/cheatsheet1999/FrontEndCollection/issues/39) 
[Unit 6: Concurrency](https://github.com/cheatsheet1999/FrontEndCollection/issues/40)   
[Unit 1 - 6 Practice Questions Solutions](https://github.com/cheatsheet1999/FrontEndCollection/issues/47) 

</details>


<details>
  <summary><strong>TikTok 🎶</strong></summary>
  
  [Count Analogous Array](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Count%20Analogous%20Array.md)  
  [Is this a tree](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Is%20this%20a%20tree.md)  
  [Longest String Chain](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Longest%20String%20Chain.md)  
  [Fizz Buzz](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Fizz%20Buzz.md)   
  [Last and Second Last](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Last%20and%20Second%20Last.md)  
  [Custom Sorted Array](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Custom%20Sorted%20Array.md)      
  [Gas Station](https://github.com/cheatsheet1999/FrontEndCollection/issues/15)  
  [Minimum Number of Steps to Make Two Strings Anagram](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram.md)     
  [Count Binary Substrings](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Count%20Binary%20Substrings.md)    
  [Anagram Difference](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Anagram%20Difference.md)    
  [Counting Analogous Arrays](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Counting%20Analogous%20Arrays.md)  
  [Reformat Date](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Reformat%20Date.md)    
  [Alaaddin Carpet](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Alaaddin%20Carpet.md)    
  [Reaching Points](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/Reaching%20Points.md)   
  [OA with not answers](https://github.com/cheatsheet1999/FrontEndCollection/blob/main/JS-Algo/OA%20with%20not%20answers.md)   
  
</details>


***
<p><em>🤯 If you find errors in the content of this project, don't hesitate to submit issues or pull requests on GitHub for corrections, I really, really appreciate it</em></p>
<p><em>🤯如果你发现本项目有任何内容上的错误，欢迎在 GitHub 提交 issues 或者 pull requests 进行打脸</em></p>
