Sorting and searching, Recusrive algorithms and Backtracking, Greedy algorithms and complete search, Dynamic Programming, Graph Traversal, Shortest path algorithms like Bellman-ford and Dijkashtra, Topological Sorting, MST, Ranged queries. Number theory, Combinatorics, Game theory and Computational geometry.
Basic structures like, Linked list, Stacks, Queue. Trees, BST, AVL Tree, Segment Tree, Fenwick Tree. Union-Find Disjoint sets Heap(Priority queue),Trie.
Control Flow and branching, Loops, Pointers, Shared pointers, Arrays, Classes and structures, Functions, Namespaces and Exceptions, Operator overloading Templates, Iterators and STL.
Basic structures like, Linked list, Stacks, Queue, Binary Search Trees, Heap(Priority queue),Trie.
Basic structures like, Linked list, Stacks, Queue, Binary Search Trees, Heap(Priority queue),Trie.
Basic structures like, Linked list, Stacks, Queue, Binary Search Trees, Heap(Priority queue),Trie.