Data Structures & Algorithms

• Algorithmic Techniques
  • Prefix Sum
  • Backtracking
• Bit Manipulation
  • Count number of bits set
• Grind 75
  • Week 1
  • Week 2
  • Week 3
  • Week 4
  • Week 5
  • Week 6
  • Week 7
  • Week 8
• JP Morgan (All time)
  • 202. Happy Number
  • 20. Valid Parentheses
  • 322. Coin Change
  • 121. Best Time to Buy and Sell Stock
  • 1328. Break a Palindrome
  • 31. Next Permutation
  • 273. Integer to English Words
  • 9. Palindrome Number
  • 1. Two Sum
  • 7. Reverse Integer
  • 17. Letter Combinations of a Phone Number
  • 200. Number of Islands
  • 53. Maximum Subarray
  • 5. Longest Palindromic Substring
  • 4. Median of Two Sorted Arrays
  • 33. Search in Rotated Sorted Array
  • 146. LRU Cache
  • 349. Intersection of Two Arrays
  • 79. Word Search
  • 215. Kth Largest Element in an Array
  • 39. Combination Sum
  • 387. First Unique Character in a String
  • 1247. Minimum Swaps to Make Strings Equal
  • 2038. Remove Colored Pieces if Both Neighbors are the Same Color
• LeetCode
  • 1. Two Sum
    • Code
  • 3. Longest Substring Without Repeating Characters
  • 5. Longest Palindromic Substring
  • 8. String to Integer (atoi)
  • 11. Container With Most Water
  • 15. 3Sum
  • 17. Letter Combinations of a Phone Number
    • Iterative Approach
    • Recursion Approach 1
    • Recursion Approach 2
    • Backtracking Approach
  • 20. Valid Parentheses
    • Code
  • 21. Merge Two Sorted Lists
    • Code
  • 33. Search in Rotated Sorted Array
  • 42. Trapping Rain Water
    • Brute-force
    • Memoization
    • Two-pointer
  • 46. Permutations
  • 53. Maximum Subarray
    • Code
  • 56. Merge Intervals
    • Code
  • 57. Insert Interval
    • Approach
    • Code
  • 62. Unique Paths
  • 70. Climbing Stairs
  • 75. Sort Colors
  • 78. Subsets
  • 84. Largest Rectangle in Histogram
    • Approach 1: Using two for loops (Time Limit Exceeded)
    • Approach 2: Using two for loops with search pruning (Time Limit Exceeded)
    • Approach 3: Using Monotonic Stack (increasing)
  • 98. Validate Binary Search Tree
  • 102. Binary Tree Level Order Traversal
    • Approach 1 - Recursion
    • Approach 2 - BFS
  • 104. Maximum Depth of Binary Tree
  • 110. Balanced Binary Tree
    • Brute-force
    • Optimized DFS
  • 121. Best Time to Buy and Sell Stock
    • Code
  • 125. Valid Palindrome
    • Code
  • 133. Clone Graph
  • 141. Linked List Cycle
  • 150. Evaluate Reverse Polish Notation
  • 155. Min Stack
    • Approach 1
      • Code
  • 169. Majority Element
    • Brute-force
    • Using HashMap
    • Boyer–Moore majority vote algorithm
  • 189. Rotate Array
    • Approach 1: Doing k rotations one by one
    • Approach 2: By Reversing
    • Approach 3: Using block-swap algorithm
  • 200. Number of Islands
  • 206. Reverse Linked List
  • 207. Course Schedule
  • 208. Implement Trie (Prefix Tree)
  • 217. Contains Duplicate
    • Approach
    • Code
  • 226. Invert Binary Tree
  • 232. Implement Queue using Stacks
  • 235. Lowest Common Ancestor of a Binary Search Tree
  • 236. Lowest Common Ancestor of a Binary Tree
  • 238. Product of Array Except Self
    • Approach
    • Code
  • 242. Valid Anagram
    • Approach 1: Keeping Count Array
    • Approach 2: Sorting
  • 278. First Bad Version
  • 295. Find Median from Data Stream
  • 322. Coin Change
    • Recursion with Memoization
    • DP
  • 325. Maximum Size Subarray Sum Equals k
    • Approach 1: Using two loops
    • Approach 2: Using prefix sum in HashMap
  • 383. Ransom Note
  • 409. Longest Palindrome
  • 542. 01 Matrix
    • Approach
    • Code
  • 543. Diameter of Binary Tree
  • 560. Subarray Sum Equals K
  • 704. Binary Search
  • 733. Flood Fill
  • 876. Middle of the Linked List
    • Approach
    • Code
  • 973. K Closest Points to Origin
    • Code
  • 994. Rotting Oranges
  • 2716. Minimize String Length