Learntocode
No description available
Install / Use
/learn @iamslash/LearntocodeREADME
- References
- 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
- Array
- Matrix
- Bit Manipulation
- Partial Sum (Prefix Sum)
- Partial Min (Prefix Min)
- List
- Stack
- Mono Stack
- Double Stack
- Queue
- Heap
- Double Heap
- Deque
- Hash Map, Set
- Ordered Map
- Rolling Hash
- Bidirectional Indexing
- String
- Suffix Array
- Tree
- Trie
- Balanced Tree
- Binary Search Tree
- Binary Indexed Tree
- Segment Tree
- Disjoint Set, Union Find, Merge Find
- Graph
- Sort
- Double Sort
- Search
- Numerical Analysis
- Number Theory and Math
- Computational Geometry
- Line Sweep
- Exhaustive Search
- Divide And Conquer
- Dynamic Programming
- Greedy
- Linear Programming
- Combinatorial Search
- 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
- Additional Challenges
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
