• References
  • Online Judges
  • Algorithm References
  • Books
  • Interactive Resources
  • Videos
  • Dynamic Programming
  • Visualization Tools
• Datatype Ranges
• Algorithm Proof
• Algorithm Analysis
• Master Theorem
• Computation Complexity
• Commandline By Programming Languages
• Collections By Programming Languages
• How to practise
• Problem Tags
• Problem Solving Strategies
• Problem Types
• Basic
  • Loop
  • Recursion
  • Subarray
  • Subsequence
• Array
• Matrix
• Bit Manipulation
• Partial Sum (Prefix Sum)
• Partial Min (Prefix Min)
• List
  • List Data Structures
  • List Algorithms
  • Advanced Algorithms and Applications
• Stack
  • Stack Data Structures
  • Stack Algorithms
• Mono Stack
• Double Stack
• Queue
• Heap
• Double Heap
• Deque
• Hash Map, Set
• Ordered Map
• Rolling Hash
• Bidirectional Indexing
• String
  • String Searching Algorithms
  • KMP Algorithm Related Problems
  • Suffixes and Substrings
  • Pattern Matching Algorithms
  • Miscellaneous String Problems
• Suffix Array
• Tree
  • Basic Tree Concepts
  • Binary Search Tree
  • Subtree-Specific Problems
  • Trie and Suffix Structures
  • Pattern Matching Algorithms
  • Priority Queue and Heap
  • Lowest Common Ancestor (LCA)
  • Miscellaneous Tree Problems
• Trie
• Balanced Tree
• Binary Search Tree
• Binary Indexed Tree
• Segment Tree
• Disjoint Set, Union Find, Merge Find
• Graph
  • Basic Graph Concepts
  • Eulerian Path and Circuit
  • Graph Connectivity
  • Puzzle Solving with Graph Algorithms
  • Shortest Path Algorithms
  • Minimum Spanning Tree
  • Maximum Flow and Matching
  • Special Graph Problems
  • Miscellaneous Graph Problems
• Sort
  • Basic Sorting Concepts
  • Comparison-Based Sorting Algorithms
  • Non-Comparison-Based Sorting Algorithms
• Double Sort
• Search
  • Binary Search and Variants
  • Selection Algorithms
  • Binary Search in Problem Solving
• Numerical Analysis
  • Root-Finding Methods
  • Integration Methods
  • Applied Numerical Problems
• Number Theory and Math
  • Basic Number Theory
  • Prime Numbers and Factorization
  • Modular Arithmetic and Advanced Algorithms
  • Permutations, Combinations, and Coefficients
  • Base and Representation
  • Fast Operations
  • Problem-Specific Applications
• Computational Geometry
  • Basic Concepts and Operations
  • Polygon Operations
  • Convex Hull Algorithms
  • Advanced Geometry Operations
  • Rotating Calipers and Closest Pair
  • Splines and Voronoi Diagrams
  • Problem-Specific Applications
• Line Sweep
• Exhaustive Search
• Divide And Conquer
• Dynamic Programming
  • Basic Concepts
  • Knapsack-Like Problems
  • Coin Change Variants
  • Partitioning Problems
  • Sequence Alignment/Matching
  • Counting Paths and Ways
  • Interval Scheduling and Profit Maximization
  • String Problems
  • Grid Problems
  • Miscellaneous Dynamic Programming
• Greedy
  • Basic Concepts
  • Classic Problems
  • Miscellaneous Greedy Problems
• Linear Programming
• Combinatorial Search
  • Basic Concepts
  • Classic Problems
  • Advanced Algorithms
  • Miscellaneous Combinatorial Search Problems
• Backtracking
• Branch and Bound
• Shortest Path
• Optimization Problems To Decision Problems
• Combinatorial Game Theory
• Minimax
• Two Pointers
• Sliding Window
• DFS (Depth First Search)
• BFS (Breadth First Search)
• Double BFS
• DFS, BFS
• Dijkstra
• Topological Sort
• Network Flow
• Finding 1st, 2nd
• Brain Teaser
• Design
• Reservoir Sampling
• Rejection Sampling
• Random
• Palindrome
• Simulated Annealing
• Concurrency
• Database
• Bash
• Problem Series
  • Find Peak Element
  • Egg Drop
  • Parentheses
  • Best Time to Buy and Sell Stock
  • Jump Game
  • Basic Calculator
  • Brace Expansion
  • TSP
  • Meeting Rooms
  • Knapsack Problems
  • Win Lose
  • Water
  • Bulb Switcher
  • Palindrome
  • Paint House
  • Course Schedule
  • Decode Ways
• Additional Challenges
  • Coding Interview Patterns by Alex Xu
  • Leetcode Top Interview Questions
  • Cracking The Coding Intervew 6 th
    • Arrays And Strings
    • Linked Lists
    • Stacks and Queues
    • Trees and Graphs
    • Bit Manipulation
    • Math and Logic Puzzles
    • Object Oriented Design
    • Recursion and Dynamic Programming
    • System Design and Scalability
    • Sorting and Searching
    • Testing
    • C and C++
    • Java
    • Databases
    • Threads and Locks
    • Moderate
    • Hard
  • 백준온라인

References

Online Judges

• L | LeetCode
• H | HackerRank
• N | NeetCode
• 알 | 알고스팟
• 백 | 백준 온라인
• G | GeeksforGeeks
• A | Codeforces
• T | TopCoder
• Codility
• UVa Online Judge
• SPOJ
• Programming Challenges

Algorithm References

• cp-algorithms
• Competitive Programmer's Handbook
• [50 Coding Questions @ ByteByByte](https://www.byte-by-byte.com/wp-content/uploads/2019/12/50-Coding-Intervi