DSA-in-December

---

Day1 : Time and Space Complexity

Day2 : Array, 2D Array, Multidimensional Array

Day3 : Strings

Day4 : Sorting Algorithms (Insertion, Selection and Bubble sort)

Day5 : Searching Algorithm (Linear and Binary Search )

Day6 : Challenge Day 1

Day7 : Challenge Day 2

Day8 : Dynamic Memory Allocation

Day9 : Pointers and Linked List

Day10 : Stack and Queues

Day11 : Challenge Day 3

Day12 : Recursion

Day13 : Recursion

Day14 : Sorting (Quick Sort and Merge Sort)

Day15 : Basic OOPs

Day16 : Complex OOPs

Day17 : Challenge Day 4

Day18 : Bit Manipulation

Day19 : Binary Tree

Day20 : Binary Search Tree

Day21 : Priority Queue (Min-Max Heap + Heap Sort

Day22 : Priority Queue

Day23 : Challenge Day 5

Day24 : Hashmap

Day25 : Trie and Huffman Coding

Day26 : Graph (Prims, Kruskal, Dijkstra, BFS,DFS, Union Find Algorithm)

Day27 : Challenge Day 6

Day28 : Dynamic Programming Level-1

Day29 : Dynamic Programming Level-2

Day30 : Backtracking

Day31 : Challenge Day 7