💻
Algorithm
  • README
  • Array
    • At Most To Equal
    • Count Inversions In An Array
    • Interleaving Placement
    • Kadane
    • Left To Right State Transition
    • Permutation
    • Quick Select
    • Sliding Window
    • Two Pointers
  • Binary Tree
    • Avl Tree
    • Binary Search Tree
    • Serialization And Deserialization
    • Traversal
  • Company
    • Facebook
  • Cpp
    • Array
    • Memset 3 F
    • Overflow
  • Data Structure
    • Binary Indexed Tree
    • Segment Tree And Binary Index Tree
    • Segment Tree
    • Stack
    • Trie
    • Union Find
  • Dynamic Programming
    • Knapsack
      • 0 1 Knapsack
      • Bounded Knapsack
      • Unbounded Knapsack
    • Bitmask Dp
    • Dp On Subsets
    • Dp On Tree
    • Dp With Sorting
    • Selective State Dp
    • Travelling Salesperson
  • Graph
    • Minimum Spanning Tree
      • Kruskal
      • Prim
    • Shortest Path
      • Bellman Ford
      • Dijkstra
      • Floyd Warshall
      • Johnson
      • Shortest Path Faster Algorithm
    • Bi Directional Breadth First Search
    • Bipartite
    • Breadth First Search
    • Component Coloring
    • Component Count
    • Depth First Search
    • Eulerian Path
    • Maximum Bipartite Matching
    • Tarjan
    • Topological Sort
    • Tree Diameter
    • Tree Ring Order Traversal
  • Greedy
    • Greedy Scheduling
    • Regret Greedy
  • Math
    • Catalan Number
    • Combinatorics
    • Factorial
    • Factorization
    • Fast Pow
    • Gcd
    • Geometry
    • Get Digits
    • Lcm
    • Median Minimizes Sum Of Absolute Deviations
    • Mode
    • Modular Multiplicative Inverse
    • Palindrome
    • Prime Number
    • Round Up
    • Sieve Of Eratosthenes
    • Stars And Bars
    • Sum Of Sequence
  • Miscellaneous
    • Bin Packing
    • Floyds Tortoise And Hare
    • Hungarian
    • Palindrome
  • Sort
    • Bubble Sort
    • Cycle Sort
    • Heap Sort
    • Merge Sort
    • Quick Sort
    • Sorting
  • Stl
    • Cpp Stl
    • Istringstream
    • Lower Bound Upper Bound
    • Priority Queue
  • String
    • Kmp
    • Manacher
    • Rabin Karp
    • String Processing
    • Z
  • Backtracking
  • Binary Answer
  • Binary Lifting
  • Binary Search
  • Bit Manipulation
  • Date
  • Difference Array
  • Discretization
  • Divide And Conquer
  • Gray Code
  • Great Problems For Practice
  • Interval Scheduling Maximization
  • Io Optimization
  • K Subset Partitioning
  • Line Sweep
  • Longest Common Subsequence
  • Longest Increasing Subsequence
  • Meet In The Middle
  • Minmax
  • Mono Deque
  • Monotonic Stack
  • Offline Query
  • P And Np
  • Prefix State Map
  • Prefix Sum
  • Random
  • Reservoir Sampling
  • Reverse Polish Notation
  • Sqrt Decomposition
Powered by GitBook
On this page
  • DP on Subsets OR Backtrack to Fill Buckets
  • Geometry
  • Trie + XOR
  • BIT (Binary Index Tree) or Segment Tree
  • Backtracking
  • Stack operation on string
  • Permutation
  • Mono Stack / Mono Deque
  • Sorting
  • Binary Indexed Tree

Was this helpful?

Great Problems For Practice

215. Kth Largest Element in an Array (Medium): Quick Select; Manually Implement Heap; API usage of nth_element, make_heap, push_heap, pop_heap

1235. Maximum Profit in Job Scheduling (Hard): DP + Binary search because of sparse value (compared to continuous indexes)

1830. Minimum Number of Operations to Make String Sorted (Hard): permutation rank with duplicates

472. Concatenated Words (Hard): Trie + DP

DP on Subsets OR Backtrack to Fill Buckets

  • 698. Partition to K Equal Sum Subsets (Medium)

  • 473. Matchsticks to Square (Medium)

  • 1723. Find Minimum Time to Finish All Jobs (Hard)

Geometry

  • 478. Generate Random Point in a Circle (Medium)

Trie + XOR

  • 421. Maximum XOR of Two Numbers in an Array (Medium)

  • 1707. Maximum XOR With an Element From Array (Hard)

  • 1803. Count Pairs With XOR in a Range (Hard)

BIT (Binary Index Tree) or Segment Tree

  • 307. Range Sum Query - Mutable (Medium)

Backtracking

  • 51. N-Queens (Hard)

  • 698. Partition to K Equal Sum Subsets (Medium)

  • 473. Matchsticks to Square (Medium)

Stack operation on string

  • 1003. Check If Word Is Valid After Substitutions (Medium)

  • 1209. Remove All Adjacent Duplicates in String II (Medium)

Permutation

  • 60. Permutation Sequence (Hard)

  • 31. Next Permutation (Medium)

Mono Stack / Mono Deque

  • 907. Sum of Subarray Minimums (Medium)

Sorting

  • 912. Sort an Array (Medium)

Binary Indexed Tree

  • 307. Range Sum Query - Mutable (Medium)

PreviousGray CodeNextInterval Scheduling Maximization

Last updated 1 year ago

Was this helpful?