https://github.com/dipjul/neetcode-150
https://github.com/dipjul/neetcode-150
Last synced: 6 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/dipjul/neetcode-150
- Owner: dipjul
- Created: 2022-04-05T06:57:56.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2022-10-16T15:32:08.000Z (about 3 years ago)
- Last Synced: 2025-02-25T06:45:08.517Z (11 months ago)
- Size: 271 KB
- Stars: 25
- Watchers: 2
- Forks: 19
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# NeetCode-150
## 1. Arrays & Hashing [Resources](https://github.com/dipjul/NeetCode-150/blob/main/01.%20Arrays%20&%20Hashing/)
1. Contains Duplicate [Solution](https://github.com/dipjul/NeetCode-150/blob/main/01.%20Arrays%20&%20Hashing/01.%20ContainsDuplicate.md)
2. Valid Anagram [Solution](https://github.com/dipjul/NeetCode-150/blob/main/01.%20Arrays%20&%20Hashing/02.ValidAnagram.md)
3. Two Sum [Solution](https://github.com/dipjul/NeetCode-150/blob/main/01.%20Arrays%20&%20Hashing/03.TwoSum.md)
4. Group Anagrams [Solution](https://github.com/dipjul/NeetCode-150/blob/main/01.%20Arrays%20&%20Hashing/04.GroupAnagrams.md)
5. Top K Frequent Elements [Solution](https://github.com/dipjul/NeetCode-150/blob/main/01.%20Arrays%20&%20Hashing/05.TopKElements.md)
6. Product of Array Except Self [Solution](https://github.com/dipjul/NeetCode-150/blob/main/01.%20Arrays%20&%20Hashing/06.ProductOfArrayExceptSelf.md)
7. Valid Sudoku [Solution](https://github.com/dipjul/NeetCode-150/blob/main/01.%20Arrays%20&%20Hashing/07.ValidSodoku.md)
8. Encode And Decode Strings [Solution](https://github.com/dipjul/NeetCode-150/blob/main/01.%20Arrays%20&%20Hashing/08.EncodeAndDecodeStrings.md)
9. Longest Consecutive Sequence [Solution](https://github.com/dipjul/NeetCode-150/blob/main/01.%20Arrays%20&%20Hashing/09.LongestConsecutiveSequence.md)
## 2. Two Pointers [Resources](https://github.com/dipjul/NeetCode-150/blob/main/02.%20Two%20Pointer/)
1. Valid Palindrome [Solution](https://github.com/dipjul/NeetCode-150/blob/main/02.%20Two%20Pointer/01.ValidPalindrome.md)
2. Two Sum II Input Array Is Sorted [Solution](https://github.com/dipjul/NeetCode-150/blob/main/02.%20Two%20Pointer/02.TwoSumII.md)
3. 3Sum [Solution](https://github.com/dipjul/NeetCode-150/blob/main/02.%20Two%20Pointer/03.3Sum.md)
4. Container With Most Water [Solution](https://github.com/dipjul/NeetCode-150/blob/main/02.%20Two%20Pointer/04.ContainerWithMostWater.md)
5. Trapping Rain Water [Solution](https://github.com/dipjul/NeetCode-150/blob/main/02.%20Two%20Pointer/05.TrappingRainWater.md)
## 3. Sliding Window [Resources](https://github.com/dipjul/NeetCode-150/blob/main/03.%20Sliding%20Window/)
1. Best Time to Buy And Sell Stock [Solution](https://github.com/dipjul/NeetCode-150/blob/main/03.%20Sliding%20Window/01.BestTimeToBuy&SellStock.md)
2. Longest Substring Without Repeating Characters [Solution](https://github.com/dipjul/NeetCode-150/blob/main/03.%20Sliding%20Window/02.LongestSubstringWithoutRepeatingCharacters.md)
3. Longest Repeating Character Replacement [Solution](https://github.com/dipjul/NeetCode-150/blob/main/03.%20Sliding%20Window/03.LongestRepeatingCharacterReplacement.md)
4. Permutation In String [Solution](https://github.com/dipjul/NeetCode-150/blob/main/03.%20Sliding%20Window/04.PermutationInString.md)
5. Minimum Window Substring [Solution](https://github.com/dipjul/NeetCode-150/blob/main/03.%20Sliding%20Window/05.MinimumWindowSubstring.md)
6. Sliding Window Maximum [Solution](https://github.com/dipjul/NeetCode-150/blob/main/03.%20Sliding%20Window/06.SlidingWindowMaximum.md)
## 4. Stack [Resources](https://github.com/dipjul/NeetCode-150/blob/main/04.%20Stack/)
1. Valid Parentheses [Solution](https://github.com/dipjul/NeetCode-150/blob/main/04.%20Stack/01.ValidParentheses.md)
2. Min Stack [Solution](https://github.com/dipjul/NeetCode-150/blob/main/04.%20Stack/02.MinStack.md)
3. Evaluate Reverse Polish Notation [Solution](https://github.com/dipjul/NeetCode-150/blob/main/04.%20Stack/03.EvaluateReversePolishNotation.md)
4. Generate Parentheses [Solution](https://github.com/dipjul/NeetCode-150/blob/main/04.%20Stack/04.GenerateParentheses.md)
5. Daily Temperatures [Solution](https://github.com/dipjul/NeetCode-150/blob/main/04.%20Stack/05.DailyTemperatures.md)
6. Car Fleet [Solution](https://github.com/dipjul/NeetCode-150/blob/main/04.%20Stack/06.CarFleet.md)
7. Largest Rectangle In Histogram [Solution](https://github.com/dipjul/NeetCode-150/blob/main/04.%20Stack/07.LargestRectangleInHistogram.md)
## 5. Binary Search [Resources](https://github.com/dipjul/NeetCode-150/blob/main/05.%20Binary%20Search/)
1. Binary Search [Solution](https://github.com/dipjul/NeetCode-150/blob/main/05.%20Binary%20Search/01.BinarySearch.md)
2. Search a 2D Matrix [Solution](https://github.com/dipjul/NeetCode-150/blob/main/05.%20Binary%20Search/02.SearchIn2DMatrix.md)
3. Koko Eating Bananas [Solution](https://github.com/dipjul/NeetCode-150/blob/main/05.%20Binary%20Search/03.KokoEatingBananas.md)
4. Search In Rotated Sorted Array [Solution](https://github.com/dipjul/NeetCode-150/blob/main/05.%20Binary%20Search/04.SearchInRotatedSortedArray.md)
5. Find Minimum In Rotated Sorted Array [Solution](https://github.com/dipjul/NeetCode-150/blob/main/05.%20Binary%20Search/05.FindMinimumInRotatedSortedArray.md)
6. Time Based Key Value Store [Solution](https://github.com/dipjul/NeetCode-150/blob/main/05.%20Binary%20Search/06.TimeBasedKeyValueStore.md)
7. Median of Two Sorted Arrays [Solution](https://github.com/dipjul/NeetCode-150/blob/main/05.%20Binary%20Search/07.MedianOfTwoSortedArrays.md)
## 6. Lined List [Resources](https://github.com/dipjul/NeetCode-150/blob/main/06.%20LinkedList/)
1. Reverse Linked List [Solution](https://github.com/dipjul/NeetCode-150/blob/main/06.%20LinkedList/01.ReverseLinkedList.md)
2. Merge Two Sorted Lists [Solution](https://github.com/dipjul/NeetCode-150/blob/main/06.%20LinkedList/02.MergeTwoLinkedList.md)
3. Reorder List [Solution](https://github.com/dipjul/NeetCode-150/blob/main/06.%20LinkedList/03.ReorderList.md)
4. Remove Nth Node From End of List [Solution](https://github.com/dipjul/NeetCode-150/blob/main/06.%20LinkedList/04.RemoveNthNodeFromEndOfTheList.md)
5. Copy List With Random Pointer [Solution](https://github.com/dipjul/NeetCode-150/blob/main/06.%20LinkedList/05.CopyListWithRandomPointer.md)
6. Add Two Numbers [Solution](https://github.com/dipjul/NeetCode-150/blob/main/06.%20LinkedList/06.AddTwoNumbers.md)
7. Linked List Cycle [Solution](https://github.com/dipjul/NeetCode-150/blob/main/06.%20LinkedList/07.LinkedListCycle.md)
8. Find The Duplicate Number [Solution](https://github.com/dipjul/NeetCode-150/blob/main/06.%20LinkedList/08.FindDuplicateNumber.md)
9. LRU Cache [Solution](https://github.com/dipjul/NeetCode-150/blob/main/06.%20LinkedList/09.LRUCache.md)
10. Merge K Sorted Lists [Solution](https://github.com/dipjul/NeetCode-150/blob/main/06.%20LinkedList/10.MergeKSortedLists.md)
11. Reverse Nodes In K Group [Solution](https://github.com/dipjul/NeetCode-150/blob/main/06.%20LinkedList/11.ReverseNodesInK-Group.md)
## 7. Trees [Resources](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/)
1. Invert Binary Tree [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/01.InvertBinaryTree.md)
2. Maximum Depth of Binary Tree [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/02.MaxDepthOfBinaryTree.md)
3. Diameter of Binary Tree [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/03.DiameterOfABinaryTree.md)
4. Balanced Binary Tree [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/04.BalancedBinaryTree.md)
5. Same Tree [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/05.SameTree.md)
6. Subtree of Another Tree [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/06.SubtreeOfAnotherTree.md)
7. Lowest Common Ancestor of a Binary Search Tree [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/07.LowsetCommonAncestorOfABinarySearchTree.md)
8. Binary Tree Level Order Traversal [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/08.BinaryTreeLevelOrderTraversal.md)
9. Binary Tree Right Side View [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/09.BinaryTreeRightSideView.md)
10. Count Good Nodes In Binary Tree [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/10.CountGoodNodesInBinaryTree.md)
11. Validate Binary Search Tree [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/11.ValidateBinarySearchTree.md)
12. Kth Smallest Element In a Bst [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/12.KthSmallestElementInABST.md)
13. Construct Binary Tree From Preorder And Inorder Traversal [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/13.ConstructBinaryTreeFromPreorderAndInorderTraversal.md)
14. Binary Tree Maximum Path Sum [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/14.BinaryTreeMaximumPathSum.md)
15. Serialize And Deserialize Binary Tree [Solution](https://github.com/dipjul/NeetCode-150/blob/main/07.%20Tree/15.SerializeAndDeserializeBinaryTree.md)
## 8. Tries [Resources](https://github.com/dipjul/NeetCode-150/blob/main/08.%20Trie/)
1. Implement Trie Prefix Tree [Solution](https://github.com/dipjul/NeetCode-150/blob/main/08.%20Trie/01.ImplementTrie.md)
2. Design Add And Search Words Data Structure [Solution](https://github.com/dipjul/NeetCode-150/blob/main/08.%20Trie/02.DesignAddandSearchWordDataStructure.md)
3. Word Search II [Solution]()
## 9. Heap / PriorityQueue [Resources](https://github.com/dipjul/NeetCode-150/blob/main/09.%20Heap%20or%20PriorityQueue/)
1. Kth Largest Element In a Stream [Solution](https://github.com/dipjul/NeetCode-150/blob/main/09.%20Heap%20or%20PriorityQueue/01.kthLargestElementInAStream.md)
2. Last Stone Weight [Solution](https://github.com/dipjul/NeetCode-150/blob/main/09.%20Heap%20or%20PriorityQueue/02.LastStoneWeight.md)
3. K Closest Points to Origin [Solution](https://github.com/dipjul/NeetCode-150/blob/main/09.%20Heap%20or%20PriorityQueue/03.KClosestPointsToOrigin.md)
4. Kth Largest Element In An Array [Solution](https://github.com/dipjul/NeetCode-150/blob/main/09.%20Heap%20or%20PriorityQueue/04.KthLargestElementInAnArray.md)
5. Task Scheduler [Solution](https://github.com/dipjul/NeetCode-150/blob/main/09.%20Heap%20or%20PriorityQueue/05.TaskScheduler.md)
6. Design Twitter
7. Find Median From Data Stream [Solution](https://github.com/dipjul/NeetCode-150/blob/main/09.%20Heap%20or%20PriorityQueue/07.FindMedianFromDataStream.md)
## 10. Backtracking [Resources](https://github.com/dipjul/NeetCode-150/blob/main/10.%20Backtracking/)
1. Subsets [Solution](https://github.com/dipjul/NeetCode-150/blob/main/10.%20Backtracking/01.Subsets.md)
2. Combination Sum [Solution](https://github.com/dipjul/NeetCode-150/blob/main/10.%20Backtracking/02.CombinationSum.md)
3. Permutations [Solution](https://github.com/dipjul/NeetCode-150/blob/main/10.%20Backtracking/03.Permutations.md)
4. Subsets II [Solution](https://github.com/dipjul/NeetCode-150/blob/main/10.%20Backtracking/04.SubsetsII.md)
5. Combination Sum II [Solution](https://github.com/dipjul/NeetCode-150/blob/main/10.%20Backtracking/05.CombinationSumII.md)
6. Word Search [Solution](https://github.com/dipjul/NeetCode-150/blob/main/10.%20Backtracking/06.WordSearch.md)
7. Palindrome Partitioning [Solution](https://github.com/dipjul/NeetCode-150/blob/main/10.%20Backtracking/07.PalindromePartitioning.md)
8. Letter Combinations of a Phone Number [Solution](https://github.com/dipjul/NeetCode-150/blob/main/10.%20Backtracking/08.LetterCombinationsOfAPhone.md)
9. N Queens [Solution](https://github.com/dipjul/NeetCode-150/blob/main/10.%20Backtracking/09.N-Queens.md)
## 11. Graphs [Resources](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/)
1. Number of Islands [Solution](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/01.NumberOfIslands.md)
2. Clone Graph [Solution](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/02.CloneGraph.md)
3. Max Area of Island [Solution](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/03.MaxAreaOfIsland.md)
4. Pacific Atlantic Water Flow [Solution](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/04.PacificAtlanticWaterFlow.md)
5. Surrounded Regions [Solution](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/05.SurroundedRegions.md)
6. Rotting Oranges [Solution](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/06.RottenOranges.md)
7. Walls And Gates [Solution](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/07.WallsAndGates.md)
8. Course Schedule [Solution](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/08.CourseSchedule.md)
9. Course Schedule II [Solution](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/09.CourseScheduleII.md)
10. Redundant Connection [Solution](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/10.RedundantConnection.md)
11. Number of Connected Components In An Undirected Graph [Solution](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/11.NumberOfConnectedComponentsInAnUndirectedGraph.md)
12. Graph Valid Tree [Solution](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/12.GraphValidTree.md)
13. Word Ladder [Solution](https://github.com/dipjul/NeetCode-150/blob/main/11.%20Graphs/13.WordLadder.md)
## 12. Advanced Graphs [Resources](https://github.com/dipjul/NeetCode-150/blob/main/12.%20Advanced%20Graphs/)
1. Reconstruct Itinerary [Solution]()
2. Min Cost to Connect All Points [Solution](https://github.com/dipjul/NeetCode-150/blob/main/12.%20Advanced%20Graphs/02.MinCostToConnectAllPoints.md)
3. Network Delay Time [Solution](https://github.com/dipjul/NeetCode-150/blob/main/12.%20Advanced%20Graphs/03.NetworkDelayTime.md)
4. Swim In Rising Water [Solution]()
5. Alien Dictionary [Solution]()
6. Cheapest Flights Within K Stops [Solution](https://github.com/dipjul/NeetCode-150/blob/main/12.%20Advanced%20Graphs/06.CheapestFlightsWithinKStops.md)
## 13. 1-D Dynamic Programming [Resources](https://github.com/dipjul/NeetCode-150/blob/main/13.%201-D%20Dynamic%20Programming/)
1. Climbing Stairs [Solution](https://github.com/dipjul/NeetCode-150/blob/main/13.%201-D%20Dynamic%20Programming/01.ClimbingStairs.md)
2. Min Cost Climbing Stairs [Solution](https://github.com/dipjul/NeetCode-150/blob/main/13.%201-D%20Dynamic%20Programming/02.MinCostClimbingStair.md)
3. House Robber [Solution](https://github.com/dipjul/NeetCode-150/blob/main/13.%201-D%20Dynamic%20Programming/03.HouseRobber.md)
4. House Robber II [Solution](https://github.com/dipjul/NeetCode-150/blob/main/13.%201-D%20Dynamic%20Programming/04.HouseRobberII.md)
5. Longest Palindromic Substring [Solution](https://github.com/dipjul/NeetCode-150/blob/main/13.%201-D%20Dynamic%20Programming/05.LongestPalindromicSubstring.md)
6. Palindromic Substrings [Solution](https://github.com/dipjul/NeetCode-150/blob/main/13.%201-D%20Dynamic%20Programming/06.PalindromicSubstrings.md)
7. Decode Ways [Solution](https://github.com/dipjul/NeetCode-150/blob/main/13.%201-D%20Dynamic%20Programming/07.DecodeWays.md)
8. Coin Change [Solution](https://github.com/dipjul/NeetCode-150/blob/main/13.%201-D%20Dynamic%20Programming/08.CoinChange.md)
9. Maximum Product Subarray [Solution](https://github.com/dipjul/NeetCode-150/blob/main/13.%201-D%20Dynamic%20Programming/09.MaxProductSubArray.md)
10. Word Break [Solution](https://github.com/dipjul/NeetCode-150/blob/main/13.%201-D%20Dynamic%20Programming/10.WordBreak.md)
11. Longest Increasing Subsequence [Solution](https://github.com/dipjul/NeetCode-150/blob/main/13.%201-D%20Dynamic%20Programming/11.LongestIncreasingSubsequence.md)
12. Partition Equal Subset Sum [Solution](https://github.com/dipjul/NeetCode-150/blob/main/13.%201-D%20Dynamic%20Programming/12.PartitionEqualSubsetSum.md)
## 14. 2-D Dynamic Programming [Resources](https://github.com/dipjul/NeetCode-150/blob/main/14.%202-D%20Dynamic%20Programming/)
1. Unique Paths [Solution](https://github.com/dipjul/NeetCode-150/blob/main/14.%202-D%20Dynamic%20Programming/01.UniquePaths.md)
2. Longest Common Subsequence [Solution](https://github.com/dipjul/NeetCode-150/blob/main/14.%202-D%20Dynamic%20Programming/02.LongestCommonSubsequence.md)
3. Best Time to Buy And Sell Stock With Cooldown [Solution](https://github.com/dipjul/NeetCode-150/blob/main/14.%202-D%20Dynamic%20Programming/03.BestTimeToBuyAndSellStockWithCooldown.md)
4. Coin Change II [Solution](https://github.com/dipjul/NeetCode-150/blob/main/14.%202-D%20Dynamic%20Programming/04.CoinChange2.md)
5. Target Sum
6. Interleaving String
7. Longest Increasing Path In a Matrix [Solution](https://github.com/dipjul/NeetCode-150/blob/main/14.%202-D%20Dynamic%20Programming/07.LongestIncreasingPathInAMatrix.md)
8. Distinct Subsequences [Solution]()
9. Edit Distance [Solution](https://github.com/dipjul/NeetCode-150/blob/main/14.%202-D%20Dynamic%20Programming/09.EditDistance.md)
10. Burst Balloons
11. Regular Expression Matching
## 15. Greedy [Resources](https://github.com/dipjul/NeetCode-150/blob/main/15.%20Greedy/)
1. Maximum Subarray [Solution](https://github.com/dipjul/NeetCode-150/blob/main/15.%20Greedy/01.MaximumSubarray.md)
2. Jump Game [Solution](https://github.com/dipjul/NeetCode-150/blob/main/15.%20Greedy/02.Jump.md)
3. Jump Game II [Solution](https://github.com/dipjul/NeetCode-150/blob/main/15.%20Greedy/03.JumpII.md)
4. Gas Station [Solution](https://github.com/dipjul/NeetCode-150/blob/main/15.%20Greedy/04.GasStation.md)
5. Hand of Straights [Solution](https://github.com/dipjul/NeetCode-150/blob/main/15.%20Greedy/05.HandOfStraights.md)
6. Merge Triplets to Form Target Triplet [Solution]()
7. Partition Labels [Solution]()
8. Valid Parenthesis String [Solution](https://github.com/dipjul/NeetCode-150/blob/main/15.%20Greedy/08.ValidParenthesisString.md)
## 16. Intervals [Resources](https://github.com/dipjul/NeetCode-150/blob/main/16.%20Intervals/)
1. Insert Interval [Solution](https://github.com/dipjul/NeetCode-150/blob/main/16.%20Intervals/01.InsertInterval.md)
2. Merge Intervals [Solution](https://github.com/dipjul/NeetCode-150/blob/main/16.%20Intervals/02.MergeInterval.md)
3. Non Overlapping Intervals [Solution](https://github.com/dipjul/NeetCode-150/blob/main/16.%20Intervals/03.Non-OverlappingIntervals.md)
4. Meeting Rooms [Solution](https://github.com/dipjul/NeetCode-150/blob/main/16.%20Intervals/04.MeetingRooms.md)
5. Meeting Rooms II [Solution](https://github.com/dipjul/NeetCode-150/blob/main/16.%20Intervals/05.MeetingRoomsII.md)
6. Minimum Interval to Include Each Query
## 17. Math & Geometry [Resources](https://github.com/dipjul/NeetCode-150/blob/main/17.%20Math%20&%20Geometry/)
1. Rotate Image [Solution](https://github.com/dipjul/NeetCode-150/blob/main/17.%20Math%20&%20Geometry/01.RotateImage.md)
2. Spiral Matrix [Solution](https://github.com/dipjul/NeetCode-150/blob/main/17.%20Math%20&%20Geometry/02.SpiralMatrix.md)
3. Set Matrix Zeroes [Solution](https://github.com/dipjul/NeetCode-150/blob/main/17.%20Math%20&%20Geometry/03.SetMatrixZeroes.md)
4. Happy Number [Solution](https://github.com/dipjul/NeetCode-150/blob/main/17.%20Math%20&%20Geometry/04.HappyNumber.md)
5. Plus One [Solution](https://github.com/dipjul/NeetCode-150/blob/main/17.%20Math%20&%20Geometry/05.PlusOne.md)
6. Pow(x, n) [Solution](https://github.com/dipjul/NeetCode-150/blob/main/17.%20Math%20&%20Geometry/06.Pow(x,n).md)
7. Multiply Strings [Solution](https://github.com/dipjul/NeetCode-150/blob/main/17.%20Math%20&%20Geometry/07.MultiplyStrings.md)
8. Detect Squares
## 18. Bit Manipulation [Resources](https://github.com/dipjul/NeetCode-150/blob/main/18.%20Bit%20Manipulation/)
1. Single Number [Solution](https://github.com/dipjul/NeetCode-150/blob/main/18.%20Bit%20Manipulation/01.SingleNumber.md)
2. Number of 1 Bits [Solution](https://github.com/dipjul/NeetCode-150/blob/main/18.%20Bit%20Manipulation/02.NumberOf1Bits.md)
3. Counting Bits [Solution](https://github.com/dipjul/NeetCode-150/blob/main/18.%20Bit%20Manipulation/03.CountingBits.md)
4. Reverse Bits [Solution](https://github.com/dipjul/NeetCode-150/blob/main/18.%20Bit%20Manipulation/04.ReverseBits.md)
5. Missing Number [Solution](https://github.com/dipjul/NeetCode-150/blob/main/18.%20Bit%20Manipulation/05.MissingNumber.md)
6. Sum of Two Integers [Solution](https://github.com/dipjul/NeetCode-150/blob/main/18.%20Bit%20Manipulation/06.SumOfTwoIntegers.md)
7. Reverse Integer
## 19. Misc-DSA (Not from Neetcode)
1. [Union Find](https://github.com/dipjul/NeetCode-150/blob/main/Misc-DSA/01.UnionFind.md)
2. [Dijkstra's Algorithm](https://github.com/dipjul/NeetCode-150/blob/main/Misc-DSA/02.Dijkstra's%20Algorithm.md)
3. [BFS on Graph](https://github.com/dipjul/NeetCode-150/blob/main/Misc-DSA/03.BFS-Graph.md)
4. [Bellman Ford](https://github.com/dipjul/NeetCode-150/blob/main/Misc-DSA/04.Bellman-ford.md)
5. [KMP Algorithm](https://github.com/dipjul/NeetCode-150/blob/main/Misc-DSA/05.KMP-Algorithm.md)
6. [Segment Tree](https://github.com/dipjul/NeetCode-150/blob/main/Misc-DSA/06.SegmentTree.md)
7. [Fenwick Tree](https://github.com/dipjul/NeetCode-150/blob/main/Misc-DSA/07.FenwickTree.md)
8. [Fenwick Tree 2D](https://github.com/dipjul/NeetCode-150/blob/main/Misc-DSA/08.FenwickTree2D.md)