1. Longest Common Substringhistorical

    LeetCode notes on the Longest Common Substring problem.

  2. Longest Common Subsequencehistorical

    LeetCode notes on the Longest Common Subsequence problem.

  3. Longest Substring Without Repeating Charactershistorical

    LeetCode notes on the longest substring without repeating characters.

  4. Edit Distancehistorical

    LeetCode notes on the Edit Distance problem.

  5. Next Permutationhistorical

    LeetCode notes on the Next Permutation problem.

  6. Permutationshistorical

    LeetCode notes on the Permutations problem.

  7. Subsetshistorical

    LeetCode notes on the Subsets problem.

  8. Unique Pathshistorical

    LeetCode notes on the Unique Paths problem.

  9. Number of Islandshistorical

    LeetCode notes on the Number of Islands problem.

  10. Maximal Squarehistorical

    LeetCode notes on the Maximal Square problem.

  11. Course Schedulehistorical

    Course Schedule problem using DFS and BFS topological sorting.

  12. Partition Equal Subset Sumhistorical

    LeetCode notes on the Partition Equal Subset Sum problem.

  13. Word Breakhistorical

    Word Break using DFS and DFS with memoization.

  14. Perfect Squareshistorical

    LeetCode notes on the Perfect Squares problem.

  15. Word Searchhistorical

    Word search in a two-dimensional grid using DFS.

  16. Target Sumhistorical

    LeetCode notes on the Target Sum problem.

  17. Longest Common Substringhistorical

    A note for the longest common substring problem.

  18. Combination Sumhistorical

    LeetCode notes on the Combination Sum problem.

  19. Design an LRU Cachehistorical

    Design an LRU cache with a map and a doubly linked list, with Go and Java implementations.

  20. Coin Changehistorical

    LeetCode notes on the Coin Change problem.

  21. Longest Common Subsequencehistorical

    Longest common subsequence using recursion, DFS with memoization, and dynamic programming.

  22. Burst Balloonshistorical

    LeetCode notes on the Burst Balloons problem.

  23. Letter Combinations of a Phone Numberhistorical

    Letter combinations of a phone number using DFS to enumerate combinations.

  24. House Robberhistorical

    LeetCode notes on the House Robber problem.

  25. Edit Distancehistorical

    Edit distance using recursion and recursion with memoization.

  26. Best Time to Buy and Sell Stock with Cooldownhistorical

    LeetCode notes on the Best Time to Buy and Sell Stock with Cooldown problem.

  27. Group Anagramshistorical

    Group anagrams using a brute-force method and hashing.

  28. Minimum Path Sumhistorical

    LeetCode notes on the Minimum Path Sum problem.

  29. Find All Anagrams in a Stringhistorical

    Find all anagrams in a string using brute force and a sliding window with counts.

  30. Longest Increasing Subsequencehistorical

    LeetCode notes on the Longest Increasing Subsequence problem.

  31. Longest Common Prefixhistorical

    Longest common prefix using a brute-force approach, with a trie idea noted.

  32. Jump Gamehistorical

    LeetCode notes on the Jump Game problem.

  33. Maximum Product Subarrayhistorical

    LeetCode notes on the Maximum Product Subarray problem.

  34. Check Palindromehistorical

    Check whether a string is a palindrome using reversal and two pointers.

  35. Maximum Subarrayhistorical

    LeetCode notes on the Maximum Subarray problem.

  36. Reverse Stringhistorical

    A Go implementation for reversing a string.

  37. First Missing Positivehistorical

    LeetCode notes on the First Missing Positive problem.

  38. Palindromic Substringshistorical

    Count palindromic substrings using brute force and center expansion.

  39. 3Sumhistorical

    LeetCode notes on the 3Sum problem.

  40. Find the Duplicate Numberhistorical

    LeetCode notes on the Find the Duplicate Number problem.

  41. Longest Palindromic Substringhistorical

    Longest palindromic substring using brute force and center expansion.

  42. Two Sumhistorical

    LeetCode notes on the Two Sum problem.

  43. Find All Numbers Disappeared in an Arrayhistorical

    LeetCode notes on finding all disappeared numbers in an array.

  44. Big Number Additionhistorical

    Add large numbers represented as strings by scanning from right to left and carrying.

  45. Subarray Sum Equals Khistorical

    LeetCode notes on the Subarray Sum Equals K problem.

  46. Longest Consecutive Sequencehistorical

    LeetCode notes on the Longest Consecutive Sequence problem.

  47. Decode Stringhistorical

    Decode strings in k[encoded_string] form using a stack.

  48. Longest Valid Parentheseshistorical

    Use a stack to mark matched parentheses, then count the longest consecutive valid interval.

  49. Remove Invalid Parentheseshistorical

    Enumerate whether to keep or remove each character, then keep the longest valid-parentheses results.

  50. Generate Parentheseshistorical

    Generate parentheses using full enumeration with a stack, and pruning based on remaining left/right parentheses.

  51. Valid Parentheseshistorical

    Validate a parentheses sequence using a stack or repeated string replacement.

  52. Regular Expression Matchinghistorical

    Regular expression matching with support for . and *.

  53. Binary Search Upper Boundhistorical

    LeetCode notes on binary-search upper bound.

  54. Longest Substring Without Repeating Charactershistorical

    Find the longest substring without repetition using a brute-force set approach and a sliding window.

  55. Find First and Last Position of Element in Sorted Arrayhistorical

    LeetCode notes on finding the first and last position of an element in a sorted array.

  56. Evaluate Divisionhistorical

    Use weighted union-find to evaluate division relationships between variables.

  57. Counting Bitshistorical

    Count the number of 1 bits in every integer from 0 through num.

  58. Hamming Distancehistorical

    Compute the Hamming distance between two integers using bitwise operations.

  59. Binary Search Upper Boundhistorical

    LeetCode notes on binary-search upper bound.

  60. Reverse Integerhistorical

    Reverse the decimal digits of a 32-bit signed integer and handle overflow.

  61. Find First and Last Position of Element in Sorted Arrayhistorical

    LeetCode notes on finding the first and last position of an element in a sorted array.

  62. Climbing Stairshistorical

    Count the ways to climb stairs using a Fibonacci recurrence.

  63. Search in Rotated Sorted Arrayhistorical

    LeetCode notes on searching in a rotated sorted array.

  64. Search in Rotated Sorted Arrayhistorical

    LeetCode notes on searching in a rotated sorted array.

  65. Merge Two Sorted Arrayshistorical

    Merge two sorted integer arrays into one sorted array.

  66. Find Peak Elementhistorical

    LeetCode notes on the Find Peak Element problem.

  67. Find the K-th Largesthistorical

    Find the K-th largest element in an array using sorting or quicksort partitioning.

  68. Binary Searchhistorical

    Use binary search to find a target value in a sorted ascending integer array.

  69. Find Minimum in Rotated Sorted Arrayhistorical

    LeetCode notes on finding the minimum in a rotated sorted array.

  70. Square Roothistorical

    LeetCode notes on computing an integer square root.

  71. Spiral Matrixhistorical

    Traverse a matrix in clockwise spiral order.

  72. Find Smallest Letter Greater Than Targethistorical

    Find the smallest letter greater than the target in a cyclically ordered character list.

  73. Trapping Rain Waterhistorical

    LeetCode notes on the Trapping Rain Water problem.

  74. Container With Most Waterhistorical

    LeetCode notes on the Container With Most Water problem.

  75. Queue Reconstruction by Heighthistorical

    Sort first and then insert by position to reconstruct a queue described by height and preceding-person counts.

  76. Largest Numberhistorical

    Rearrange non-negative integers so their concatenation forms the largest integer.

  77. Top K Frequent Elementshistorical

    Find the top K frequent elements using frequency counting with sorting or a min-heap.

  78. Majority Elementhistorical

    Find the majority element using a counting map or candidate cancellation.

  79. Single Numberhistorical

    Find the element that appears only once using counting or XOR.

  80. Move Zeroeshistorical

    Move all zeroes to the end of the array while preserving the relative order of non-zero elements.

  81. Product of Array Except Selfhistorical

    Compute the product of array elements except self using left and right product arrays.

  82. Sort Colorshistorical

    Sort 0, 1, and 2 in place using quicksort, bucket sort, or the move-zeroes idea.

  83. Search a 2D Matrixhistorical

    Search a matrix whose rows and columns are both sorted, starting from the top-right corner.

  84. Maximum Product Subarrayhistorical

    LeetCode notes on the Maximum Product Subarray problem.

  85. Subarray Sum Equals Khistorical

    LeetCode notes on the brute-force solution for Subarray Sum Equals K.

  86. Maximal Squarehistorical

    LeetCode notes on the brute-force solution for Maximal Square.

  87. Daily Temperatureshistorical

    LeetCode notes on the brute-force solution for Daily Temperatures.

  88. Daily Temperatureshistorical

    LeetCode notes on Daily Temperatures with brute force and a monotonic stack.

  89. Sliding Window Maximumhistorical

    LeetCode notes on Sliding Window Maximum using brute force, a priority queue, and a monotonic deque.

  90. Merge Intervalshistorical

    LeetCode notes on merging overlapping intervals.

  91. Min Stackhistorical

    LeetCode notes on implementing a stack that retrieves the minimum element in constant time.

  92. Sort an Arrayhistorical

    LeetCode notes on sorting an array with merge sort and quicksort.

  93. Median of Two Sorted Arrayshistorical

    LeetCode notes on finding the median of two sorted arrays by merging them.

  94. Jump Gamehistorical

    LeetCode notes on the Jump Game problem.

  95. Shortest Unsorted Continuous Subarrayhistorical

    LeetCode notes on finding the shortest continuous subarray that must be sorted.

  96. Best Time to Buy and Sell Stockhistorical

    LeetCode notes on maximizing profit from one stock transaction.

  97. Rotate Imagehistorical

    LeetCode notes on rotating an n x n matrix 90 degrees clockwise.

  98. Implement Trie (Prefix Tree)historical

    LeetCode notes on implementing a Trie prefix tree.

  99. Unique Binary Search Treeshistorical

    LeetCode notes on counting unique binary search trees with DFS, memoization, and dynamic programming.

  100. Binary Tree Inorder Traversalhistorical

    LeetCode notes on binary tree inorder traversal with recursion and color marking.

  101. Construct Binary Tree from Preorder and Inorder Traversalhistorical

    LeetCode notes on reconstructing a binary tree from preorder and inorder traversals.

  102. Binary Tree Preorder, Inorder, and Postorder Traversalhistorical

    Notes on implementing preorder, inorder, and postorder traversal of a binary tree.

  103. Convert BST to Greater Treehistorical

    LeetCode notes on converting a binary search tree to a Greater Sum Tree.

  104. Validate Binary Search Treehistorical

    LeetCode notes on validating a binary search tree with inorder traversal.

  105. Flatten Binary Tree to Linked Listhistorical

    LeetCode notes on flattening a binary tree into a linked list in preorder.

  106. Lowest Common Ancestor of a Binary Treehistorical

    LeetCode notes on finding the lowest common ancestor in a binary tree.

  107. Diameter of Binary Treehistorical

    LeetCode notes on calculating the diameter of a binary tree.

  108. Lowest Common Ancestor Nodehistorical

    Notes on finding the lowest common ancestor of two nodes in a binary tree.

  109. Merge Two Binary Treeshistorical

    LeetCode notes on merging two binary trees.

  110. Symmetric Treehistorical

    LeetCode notes on checking whether a binary tree is mirror-symmetric.

  111. House Robber IIIhistorical

    LeetCode notes on House Robber III using DFS and memoization.

  112. Sum Root to Leaf Numbershistorical

    LeetCode notes on summing all numbers formed by root-to-leaf paths.

  113. Invert Binary Treehistorical

    LeetCode notes on Invert Binary Tree.

  114. Path Sum IIIhistorical

    LeetCode notes on Path Sum III.

  115. Maximum Depth of Binary Treehistorical

    LeetCode notes on Maximum Depth of Binary Tree.

  116. Binary Tree Maximum Path Sumhistorical

    LeetCode notes on Binary Tree Maximum Path Sum.

  117. Binary Tree Right Side Viewhistorical

    LeetCode notes on Binary Tree Right Side View.

  118. Binary Tree Level Order Traversalhistorical

    LeetCode notes on Binary Tree Level Order Traversal.

  119. Serialize and Deserialize Binary Treehistorical

    LeetCode notes on Serialize and Deserialize Binary Tree.

  120. Binary Tree Zigzag Level Order Traversalhistorical

    LeetCode notes on Binary Tree Zigzag Level Order Traversal.

  121. Swap Nodes in Pairshistorical

    LeetCode notes on Swap Nodes in Pairs.

  122. Reverse Linked List IIhistorical

    LeetCode notes on Reverse Linked List II.

  123. Reverse Linked Listhistorical

    LeetCode notes on Reverse Linked List.

  124. Reverse Nodes in k-Grouphistorical

    LeetCode notes on Reverse Nodes in k-Group.

  125. Add Two Numbershistorical

    LeetCode notes on Add Two Numbers.

  126. Remove Duplicates from Sorted List IIhistorical

    LeetCode notes on Remove Duplicates from Sorted List II.

  127. Remove Duplicates from Sorted Listhistorical

    LeetCode notes on Remove Duplicates from Sorted List.

  128. Remove Nth Node From End of Listhistorical

    LeetCode notes on Remove Nth Node From End of List.

  129. Palindrome Linked Listhistorical

    LeetCode notes on Palindrome Linked List.

  130. Palindrome Linked Listhistorical

    LeetCode notes on Palindrome Linked List.

  131. Linked List Cyclehistorical

    LeetCode notes on Linked List Cycle.

  132. Linked List Cycle IIhistorical

    LeetCode notes on Linked List Cycle II.

  133. Rotate Listhistorical

    LeetCode notes on Rotate List.

  134. Linked List Cyclehistorical

    LeetCode notes on Linked List Cycle.

  135. Linked List Cycle IIhistorical

    LeetCode notes on Linked List Cycle II.

  136. Intersection of Two Linked Listshistorical

    LeetCode notes on Intersection of Two Linked Lists.

  137. Reorder Listhistorical

    LeetCode notes on Reorder List.

  138. Partition Listhistorical

    LeetCode notes on Partition List.

  139. Merge k Sorted Listshistorical

    LeetCode notes on Merge k Sorted Lists.

  140. Merge Two Sorted Listshistorical

    LeetCode notes on Merge Two Sorted Lists.

  141. Odd Even Linked Listhistorical

    LeetCode notes on Odd Even Linked List.

  142. Sort Listhistorical

    LeetCode notes on Sort List.

  143. Intersection of Two Linked Listshistorical

    LeetCode notes on Intersection of Two Linked Lists.