A Curated list of Topic wise Theory and Questions to Get You Started On Competitive Coding.
- Binary and Ternary Search
- Dynamic Programming
- Game Theory
- Matrix Exponentiation
- Prefix and Suffix Trees
- Binary Indexed Trees
- Segment Trees
Binary and Ternary Search
Binary Search : The process of exploiting the property of an array of being sorted to arrive at answers of questions in non linear time.
Ternary Search : The process of exploiting the property of a function having double diffrential of a constant sign to arrive to results in non linear time.
Used to solve questions which can be broken down into smaller sub problems.It involves the technique of saving the result of a problem for future reference.
Used to solve problems involving mathematical modelling of conflict and cooperation among rational players.
A graph consists of nodes and the interconnection between them.The problems involve finding shortest distance, connectivity and flow.
Greedy problems involve solving a problem statement considering the most greedy, i.e. most optimal solution at the given time without taking into consideration the future effects of it.
Problem related to mathematics are quite common in the domain of competitive programming.It involved topics like geometry, algebra, discrete mathematics and probability.
Used to solve problems which involve finding a solution to a given series by using exponentiation property on multiplication of matrices.The complexity is thus reduced to logrithmic from linear.
Persistant Segment Trees
Prefix and Suffix Trees
Tries are some kind of rooted trees in which each edge has a character on it.
Binary Indexed Trees
A Fenwick tree or binary indexed tree is a data structure that can efficiently update elements and calculate prefix sums in a table of numbers.
Segment tree is a tree for which each node represents an interval.
A tree is a data structure made up of nodes or vertices and edges without having any cycle.