DSA Practice — Bullish Path

📦

Arrays

0 / 12 solved

#1Two SumHash MapEasy

#2Best Time to Buy and Sell StockSliding WindowEasy

#3Contains DuplicateSetEasy

#4Product of Array Except SelfPrefix SumMedium

#5Maximum Subarray (Kadane's)DPMedium

#63SumTwo PointersMedium

#7Trapping Rain WaterStackHard

🔗

Linked List

0 / 8 solved

#1Reverse a Linked ListIterativeEasy

#2Detect Cycle in a Linked ListFloyd's AlgorithmEasy

#3Merge Two Sorted ListsRecursionEasy

#4LRU CacheHashMap + DLLMedium

#5Merge K Sorted ListsHeapHard

🌳

Trees & Binary Search Trees

0 / 10 solved

#1Maximum Depth of Binary TreeDFSEasy

#2Invert Binary TreeRecursionEasy

#3Validate Binary Search TreeDFSMedium

#4Binary Tree Level Order TraversalBFSMedium

#5Serialize and Deserialize Binary TreeBFS/DFSHard

🕸️

Graphs

0 / 8 solved

#1Number of IslandsDFS / BFSMedium

#2Clone GraphBFSMedium

#3Course Schedule (Topological Sort)Kahn's AlgoMedium

#4Dijkstra's Shortest PathPriority QueueHard

⚡

Dynamic Programming

0 / 10 solved

#1Climbing Stairs (Fibonacci DP)1D DPEasy

#2House Robber1D DPMedium

#3Longest Common Subsequence2D DPMedium

#40/1 Knapsack2D DPMedium

#5Edit Distance2D DPHard

🔤

Strings

#1Valid AnagramHash MapEasy

#2Longest Substring Without Repeating CharsSliding WindowMedium