DSA Quest

Bubble Sort

Swap adjacent elements to sort the array.

Binary Search

Find the target number efficiently.

BST Search

Navigate a Binary Search Tree to find a value.

Graph BFS

Find the shortest path through the grid.

Dijkstra's Algo

Find the lowest cost path through weighted nodes.

Tower of Hanoi

Move the stack to the last peg obeying the rules.

Selection Sort

Find the minimum and place it in order.

Tree DFS

Traverse the tree (Root-Left-Right).

Knapsack

Maximize value within weight limit.

Bubble Sort

Classic pairwise swapping.

Insertion Sort

Building a sorted array one item at a time.

Merge Sort

Divide and conquer approach.

Selection Sort

Finds minimum element repeatedly.

Quick Sort

Partitions array around a pivot.

Heap Sort

Uses a binary heap data structure.

Shell Sort

Optimization of insertion sort using gaps.

Cocktail Shaker

Bidirectional bubble sort.

Radix Sort

Non-comparative integer sorting.