Implementation techniques - Kho bài tập

ID	Bài toán Hiện nhãn Hide tags	AC / Tried	Độ khó
978	CCBCHBAHAI0000060 Phần tử gần trung bình nhất (Element Closest to the Average) Programming language basics Static arrays Iteration techniques Implementation techniques Working with numbers Integer arithmetic	0 / 0	1
979	CCBCHBAHAI0000061 Vị trí số khác 0 đầu tiên và cuối cùng (First and Last Nonzero Positions) Programming language basics Static arrays Iteration techniques Implementation techniques	0 / 0	1
981	CCBCHBAHAI0000063 Statistics (Statistics) Programming language basics Static arrays Iteration techniques Implementation techniques Working with numbers	0 / 0	1
982	CCBCHBAHAI0000064 Kiểm tra mọi phần tử bằng nhau (Check Whether All Elements Are Equal) Programming language basics Static arrays Iteration techniques Implementation techniques	0 / 0	1
983	CCBCHBAHAI0000065 Kiểm tra mảng không giảm (Check a Nondecreasing Array) Programming language basics Static arrays Iteration techniques Implementation techniques	0 / 0	1
984	CCBCHBAHAI0000066 Kiểm tra mảng tăng nghiêm ngặt (Check a Strictly Increasing Array) Programming language basics Static arrays Iteration techniques Implementation techniques	0 / 0	1
985	CCBCHBAHAI0000067 Đếm số lần đổi dấu giữa hai phần tử kề (Count Sign Changes Between Adjacent Elements) Programming language basics Static arrays Iteration techniques Implementation techniques Integer arithmetic	0 / 0	1
986	CCBCHBAHAI0000068 Mảng đối xứng số nguyên (Integer Palindrome Array) Programming language basics Static arrays Iteration techniques Implementation techniques	0 / 0	1
987	CCBCHBAHAI0000069 Tổng từng cặp đối xứng (Sums of Symmetric Pairs) Programming language basics Static arrays Iteration techniques Implementation techniques Integer arithmetic	0 / 0	1
988	CCBCHBAHAI0000070 Đảo mảng bằng mảng phụ (Reverse an Array with an Auxiliary Array) Programming language basics Static arrays Iteration techniques Implementation techniques	0 / 0	1
989	CCBCHBAHAI0000071 Dịch vòng trái d bước bằng mảng phụ (Left Rotate by d Using an Auxiliary Array) Programming language basics Static arrays Iteration techniques Implementation techniques Integer arithmetic	0 / 0	1
990	CCBCHBAHAI0000072 Dịch vòng phải d bước bằng mảng phụ (Right Rotate by d Using an Auxiliary Array) Programming language basics Static arrays Iteration techniques Implementation techniques Integer arithmetic	0 / 0	1
992	CCBCHBAHAI0000074 Chèn x sau lần xuất hiện đầu tiên của y (Insert x After the First Occurrence of y) Programming language basics Static arrays Iteration techniques Implementation techniques	0 / 0	1
993	CCBCHBAHAI0000075 Chèn x trước lần xuất hiện cuối cùng của y (Insert x Before the Last Occurrence of y) Programming language basics Static arrays Iteration techniques Implementation techniques	0 / 0	1
994	CCBCHBAHAI0000076 Xóa mọi số 0, giữ thứ tự (Remove All Zeros While Preserving Order) Programming language basics Static arrays Iteration techniques Implementation techniques	0 / 0	1
995	CCBCHBAHAI0000077 Xóa mọi phần tử ngoài đoạn [L, R] (Remove Elements Outside [L, R]) Programming language basics Static arrays Iteration techniques Implementation techniques	0 / 0	1
996	CCBCHBAHAI0000078 Concatenation of Array Programming language basics Static arrays Iteration techniques Implementation techniques	0 / 0	1
997	CCBCHBAHAI0000079 Tách mảng thành mảng chẵn và mảng lẻ (Split an Array into Even and Odd Arrays) Programming language basics Static arrays Iteration techniques Implementation techniques Working with numbers Integer arithmetic	0 / 0	1
998	CCBCHBAHAI0000080 Tách âm - zero - dương vào ba mảng (Split Negative, Zero, and Positive Values) Programming language basics Static arrays Iteration techniques Implementation techniques Working with numbers Integer arithmetic	0 / 0	1
999	CCBCHBAHAI0000081 Equalize the Array Programming language basics Static arrays Iteration techniques Implementation techniques Working with numbers	0 / 0	1

Fundamentals
1. Input and output
2. Programming language basics
3. Variables and data types
4. Integer arithmetic
5. Floating point arithmetic
6. Working with numbers
7. Basic mathematics
8. Integer overflow
9. Recursion basics
10. Iteration techniques
11. Time complexity
12. Space complexity
13. Big-O notation
14. Implementation techniques
15. Debugging techniques
Sorting and Searching
1. Sorting algorithms
2. Stable sorting
3. Custom comparators
4. Counting sort
5. Radix sort
6. Bucket sort
7. Coordinate compression
8. Binary search
9. Binary search on answer
10. Ternary search
11. Two-way partitioning
12. Sweep line technique
13. Offline sorting
14. Event sorting
Data Structures
1. Static arrays
2. Dynamic arrays
3. Vector
4. Linked lists
5. Stack
6. Queue
7. Deque
8. Priority queue
9. Heap
10. Set structures
11. Multiset structures
12. Map structures
13. Hash tables
14. Ordered sets
15. Balanced binary search trees
16. Disjoint set union
17. Union-find
Advanced Data Structures
1. Binary indexed tree
2. Segment tree
3. Lazy propagation
4. Persistent segment tree
5. Dynamic segment tree
6. Sparse table
7. Treap
8. Splay tree
9. AVL tree
10. Red-black tree
11. Order statistic tree
12. Wavelet tree
13. Link-cut tree
14. Euler tour tree
15. K-D tree
Complete Search
1. Brute force
2. Generating subsets
3. Generating permutations
4. Generating combinations
5. Backtracking
6. State-space search
7. DFS search
8. BFS search
9. Pruning the search
10. Branch and bound
11. Meet in the middle
Greedy Algorithms
1. Coin problem
2. Activity selection
3. Interval scheduling
4. Scheduling
5. Tasks and deadlines
6. Minimizing sums
7. Data compression
8. Huffman coding
9. Greedy proof techniques
10. Exchange arguments
11. Matroid greedy
Dynamic Programming
1. Dynamic programming basics
2. Memoization
3. Bottom-up DP
4. Coin problem DP
5. Longest increasing subsequence
6. Longest common subsequence
7. Paths in a grid
8. Knapsack
9. Edit distance
10. Counting tilings
11. Interval DP
12. Tree DP
13. Digit DP
14. Profile DP
15. Bitmask DP
16. DP on DAG
17. State compression
Advanced Dynamic Programming
1. Divide and conquer optimization
2. Knuth optimization
3. Convex hull trick DP
4. Li Chao tree DP
5. Aliens trick
6. Slope trick
7. Rerooting DP
8. Optimization with monotonic queues
Amortized Analysis
1. Amortized complexity
2. Two pointers
3. Sliding window
4. Nearest smaller elements
5. Monotonic stack
6. Monotonic queue
7. Sliding window minimum
Range Queries
1. Prefix sums
2. Difference arrays
3. Static array queries
4. Range minimum query
5. Range maximum query
6. Binary indexed tree
7. Fenwick tree
8. Segment tree
9. Lazy propagation
10. Sparse table
11. Mo's algorithm
12. Offline queries
13. Parallel binary search
Bit Manipulation
1. Bit representation
2. Bit operations
3. Bit masks
4. Representing sets
5. Bit optimization
6. Bit tricks
7. Submask enumeration
8. Gray code
9. Bitwise DP
10. Bitmask dynamic programming
Graph Basics
1. Graph terminology
2. Directed graphs
3. Undirected graphs
4. Weighted graphs
5. Graph representation
6. Adjacency matrix
7. Adjacency list
8. Depth-first search
9. Breadth-first search
10. Connected components
11. Flood fill
12. Bipartite graph checking
13. Cycle detection
Shortest Paths
1. BFS shortest path
2. 0-1 BFS
3. Bellman-Ford
4. Dijkstra
5. Floyd-Warshall
6. Johnson algorithm
7. Shortest path reconstruction
8. Negative cycle detection
Tree Algorithms
1. Tree terminology
2. Tree representation
3. Tree traversal
4. DFS on trees
5. Tree diameter
6. Longest paths
7. Binary trees
8. Binary lifting
9. Finding ancestors
10. Lowest common ancestor
11. Euler tour technique
12. Subtrees and paths
13. Offline tree algorithms
14. Heavy-light decomposition
15. Centroid decomposition
Spanning Trees
1. Minimum spanning tree
2. Kruskal
3. Union-find
4. Prim
5. Boruvka algorithm
6. Second best MST
Directed Graphs
1. Topological sorting
2. DAG dynamic programming
3. Successor paths
4. Functional graphs
5. Cycle detection
6. Strongly connected components
7. Kosaraju algorithm
8. Tarjan algorithm
9. 2-SAT
Advanced Graph Algorithms
1. Bridges
2. Articulation points
3. Biconnected components
4. Block-cut tree
5. Euler tour graph techniques
6. Dynamic connectivity
7. Offline graph queries
8. Minimum cut tree
9. Gomory-Hu tree
Paths and Flows
1. Eulerian paths
2. Eulerian circuits
3. Hamiltonian paths
4. De Bruijn sequences
5. Ford-Fulkerson
6. Edmonds-Karp
7. Dinic algorithm
8. Maximum flow
9. Minimum cut
10. Disjoint paths
11. Path covers
12. Min-cost max-flow
Matching
1. Bipartite matching
2. Kuhn algorithm
3. Hopcroft-Karp algorithm
4. Maximum matching
5. Weighted matching
6. Hungarian algorithm
7. Blossom algorithm
Number Theory
1. Prime numbers
2. Sieve of Eratosthenes
3. Linear sieve
4. Prime factorization
5. Divisors
6. GCD
7. LCM
8. Euclidean algorithm
9. Extended Euclidean algorithm
10. Modular arithmetic
11. Modular inverse
12. Fast exponentiation
13. Euler phi function
14. Chinese remainder theorem
Advanced Number Theory
1. Miller-Rabin primality test
2. Pollard-Rho factorization
3. Mobius function
4. Mobius inversion
5. Discrete logarithm
6. Baby-step giant-step
7. Primitive roots
8. Lucas theorem
9. Number theoretic transforms
Combinatorics
1. Counting principles
2. Permutations
3. Combinations
4. Binomial coefficients
5. Catalan numbers
6. Inclusion-exclusion
7. Burnside's lemma
8. Cayley's formula
9. Stars and bars
10. Generating functions
Matrices
1. Matrix operations
2. Matrix multiplication
3. Matrix exponentiation
4. Linear recurrences
5. Fibonacci acceleration
6. Graphs and matrices
7. Gaussian elimination
8. Determinants
Probability
1. Probability calculation
2. Events
3. Conditional probability
4. Expected value
5. Random variables
6. Markov chains
7. Randomized algorithms
8. Probability DP
Game Theory
1. Game states
2. Winning states
3. Losing states
4. Nim game
5. Sprague-Grundy theorem
6. Impartial games
7. Grundy numbers
String Algorithms
1. String terminology
2. String processing basics
3. Trie
4. Prefix function
5. Knuth-Morris-Pratt
6. String hashing
7. Rolling hash
8. Z-algorithm
9. Aho-Corasick
10. Palindrome algorithms
11. Manacher algorithm
Advanced String Algorithms
1. Suffix array
2. LCP array
3. Suffix tree
4. Suffix automaton
5. Palindromic tree
6. Lyndon factorization
Polynomial Algorithms
1. Polynomial representation
2. Polynomial multiplication
3. FFT
4. Number theoretic transform
5. Formal power series
6. Polynomial inverse
7. Polynomial logarithm
8. Polynomial exponentiation
Numerical Algorithms
1. Numerical search
2. Newton method
3. Simpson integration
4. Numerical integration
5. Gaussian elimination
6. Matrix determinant
Geometry
1. Computational geometry basics
2. Complex numbers
3. Points and lines
4. Vectors
5. Distance functions
6. Polygon area
7. Shoelace formula
8. Orientation test
9. Intersection points
10. Circle geometry
11. Closest pair
12. Sweep line
13. Convex hull
14. Rotating calipers
Advanced Geometry
1. Half-plane intersection
2. Voronoi diagram
3. Delaunay triangulation
4. Minkowski sum
5. Point location
6. Polygon cutting
7. 3D geometry
Advanced Techniques
1. Square root decomposition
2. Mo's algorithm
3. Offline algorithms
4. Persistent data structures
5. Randomized algorithms
6. Randomized data structures
7. Parallel binary search
8. Divide and conquer techniques
9. Convex hull trick
10. Li Chao tree
11. Optimization techniques

Ngẫu nhiên

Chọn ngẫu nhiên một bài theo bộ lọc hiện tại.

Danh mục

Fundamentals

Sorting and Searching

Data Structures

Advanced Data Structures

Complete Search

Greedy Algorithms

Dynamic Programming

Advanced Dynamic Programming

Amortized Analysis

Range Queries

Bit Manipulation

Graph Basics

Shortest Paths

Tree Algorithms

Spanning Trees

Directed Graphs

Advanced Graph Algorithms

Paths and Flows

Matching

Number Theory

Advanced Number Theory

Combinatorics

Matrices

Probability

Game Theory

String Algorithms

Advanced String Algorithms

Polynomial Algorithms

Numerical Algorithms

Geometry

Advanced Geometry

Advanced Techniques

Trạng thái

Phát triển

Hỗ trợ

Giới thiệu

Danh mục

Trạng thái

Phát triển

Hỗ trợ

Giới thiệu

Chưa có tài khoản?

ĐĂNG NHẬP