Techniques

Solutions organized by algorithmic techniques and problem-solving strategies

Collection of LeetCode solutions categorized by fundamental algorithmic techniques:

  • Two Pointers
  • Binary Search
  • Binary Search on the Answer
  • Binary Search on Float Number + Ternary Search
  • Greedy
  • Recursion + Backtracking
  • Divide and Conquer

Two Pointers

Solutions that utilize the two pointers technique

Binary Search

Solutions that utilize the binary search algorithm

Binary Search on the Answer

Solutions that utilize binary search to find the optimal answer

Binary Search on Float & Ternary Search

Solutions that utilize binary search on float numbers and ternary search

Greedy

Solutions that utilize greedy algorithms

Recursion + Backtracking

Solutions that utilize recursion and backtracking techniques

Divide and Conquer

Solutions that utilize divide and conquer algorithms