This repository contains a structured collection of DSA problems, categorized into folders for better organization and learning.
- N-Queens Problem
- Sudoku Solver
- Rat in a Maze
- Subset Sum Problem
- Fibonacci
- Knapsack Problem
- Longest Common Subsequence (LCS)
- Coin Change Problem
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Dijkstra's Algorithm
- Prim's Algorithm
- Activity Selection
- Huffman Coding
- Fractional Knapsack
- Job Sequencing Problem
- Two Sum Problem
- Find Missing Number
- Longest Substring Without Repeating Characters
- Anagram Detection
- Reverse Linked List
- Detect Loop in Linked List
- Merge Two Sorted Linked Lists
- Remove Duplicates from Sorted List
- Implement Queue using Arrays
- Implement Queue using Linked List
- Circular Queue
- Queue Reversal
- Tower of Hanoi
- Factorial
- Permutations and Combinations
- Subsets Generation
- Binary Search
- Linear Search
- Search in Rotated Sorted Array
- Search for Element in Matrix
- Quick Sort
- Merge Sort
- Insertion Sort
- Bubble Sort
- Balanced Parentheses
- Stock Span Problem
- Next Greater Element
- Evaluate Postfix Expression
- Filtering with Streams
- Mapping with Streams
- Sorting with Streams
- Collecting into Lists/Maps
- Binary Tree Traversal (Inorder, Preorder, Postorder)
- Binary Search Tree (BST)
- AVL Tree
- Lowest Common Ancestor (LCA)
if the particular problem isn't present, then im still learning it bro TT