HashNode: https://swastiksharma.hashnode.dev/
Dev.io: https://dev.to/swastiksharma-dev
Markdown files in the repository for each concept have been maintained with questions and solutions. Make sure to check them out.
Solutions to many concepts/questions have not been updated yet but soon I will update it.
-
Array
- 1D Array
- 2D Array
- 3D Array
-
Strings
-
Two Pointers
-
Sliding Window
-
Recursion
-
Matrix
-
Searching
- Linear Search
- Binary Search
- Jump Search
- Interpolation Search
- Exponential Search
- Fibonacci Search
- Ternary Search
- Sublist Search
- Hashing
-
LinkedLists
- Singly LinkedList
- Doubly LinkedList
- Circular LinkedList
-
Stacks
- Stack using Array
- Stack using LinkedList
- Stack using Queue
-
Queues
- Queue using Array
- Queue using LinkedList
- Queue using Stack
- Circular Queue
- Priority Queue
- Dequeue
-
Trees
- Binary Tree
- Binary Search Tree
- AVL Tree
-
Graphs
- BFS
- DFS
- Dijkstra's Algorithm
- Floyd Warshall Algorithm
- Kruskal's Algorithm
- Prim's Algorithm
- Bellman Ford Algorithm
- Topological Sort
-
Heaps
- Min Heap
- Max Heap
- Heap Sort
- Priority Queue
-
Hashing
- Hash Table
- Hash Map
- Hash Set
- Hash Function
- Collision Handling
- Open Addressing
- Separate Chaining
- Linear Probing
- Quadratic Probing
- Double Hashing
- Rehashing
-
Sorting
- Bubble Sort
- Optimized Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Counting Sort
- Radix Sort
- Bucket Sort
- Shell Sort
- Comb Sort
- Pigeonhole Sort
- Cycle Sort
-
Greedy Algorithms
- Fractional Knapsack
- Job Sequencing
- Huffman Coding
- Prim's Algorithm
- Kruskal's Algorithm
- Dijkstra's Algorithm
-
Dynamic Programming
- Fibonacci Series
- Factorial
- Longest Common Subsequence
- Longest Increasing Subsequence
- 0/1 Knapsack
- Subset Sum
- Matrix Chain Multiplication
-
Backtracking
- N-Queens Problem
- Rat in a Maze
- Sudoku Solver
- Hamiltonian Cycle
- Knight's Tour
-
Bit Manipulation