Data Structures & Algorithms Study Materials

Array operations, multidimensional arrays, string manipulation, and common problems.

Singly, doubly, circular linked lists — insertion, deletion, reversal, and Floyd's cycle detection.

Stack and queue operations, applications (infix-postfix), deque, and priority queue.

Binary trees, BST, AVL trees, heap, segment tree — traversals and operations.

Graph representations, BFS, DFS, Dijkstra, Bellman-Ford, Floyd-Warshall, and MST (Prim, Kruskal).

Bubble, selection, insertion, merge, quicksort, heapsort — time and space complexity.

Linear search, binary search, interpolation search, and hash-based search.

Memoisation, tabulation, knapsack, LCS, LIS, coin change, and matrix chain multiplication.

Activity selection, fractional knapsack, Huffman coding, and job scheduling.

Hash functions, collision resolution (chaining, open addressing), and applications.

Recursive thinking, base cases, N-queens, sudoku solver, and rat in a maze.

Big-O, Big-Theta, Big-Omega, best/worst/average case analysis, and recurrence relations.