450

DSA Notes

450 Problems

  • []Array
    36
  • [[]]Matrix
    10
  • "s"String
    43
  • ?Searching & Sorting
    36
  • ->LinkedList
    36
  • /\Binary Trees
    35
  • <>BST
    22
  • $Greedy
    35
  • <-BackTracking
    19
  • ||Stacks & Queues
    38
  • /\Heap
    18
  • o-oGraph
    44
  • TTrie
    6
  • DPDynamic Programming
    60
  • 01Bit Manipulation
    10
Home
447 Problems

DSA 450 Notes

A comprehensive collection of Data Structures and Algorithms problems with both brute force and optimal solutions, along with time complexity analysis.

Brute Force
Optimal Solution
Time Complexity
[]36 problems
Array
Master array with step-by-step solutions
View problems
[[]]10 problems
Matrix
Master matrix with step-by-step solutions
View problems
"s"43 problems
String
Master string with step-by-step solutions
View problems
?36 problems
Searching & Sorting
Master searching & sorting with step-by-step solutions
View problems
->36 problems
LinkedList
Master linkedlist with step-by-step solutions
View problems
/\35 problems
Binary Trees
Master binary trees with step-by-step solutions
View problems
<>22 problems
Binary Search Trees
Master binary search trees with step-by-step solutions
View problems
$35 problems
Greedy
Master greedy with step-by-step solutions
View problems
<-19 problems
BackTracking
Master backtracking with step-by-step solutions
View problems
||38 problems
Stacks & Queues
Master stacks & queues with step-by-step solutions
View problems
/\18 problems
Heap
Master heap with step-by-step solutions
View problems
o-o43 problems
Graph
Master graph with step-by-step solutions
View problems
T6 problems
Trie
Master trie with step-by-step solutions
View problems
DP60 problems
Dynamic Programming
Master dynamic programming with step-by-step solutions
View problems
0110 problems
Bit Manipulation
Master bit manipulation with step-by-step solutions
View problems