📚 Data Structures & Algorithms Practice
Welcome to my Data Structures and Algorithms (DSA) practice repository!
This repo contains my personal journey of solving coding problems while learning and improving problem-solving skills in computer science fundamentals.
🚀 Purpose
Strengthen my understanding of algorithms and data structures
Prepare for coding interviews
Build a long-term coding habit
Keep a track of problems solved across different platforms like LeetCode, GeeksforGeeks, Codeforces, etc.
🗂️ Folder Structure
dsa-practice/
├── README.md
├── reverseLinkedList.py
├── twoSum.py
├── factorial.py └── ...
Each folder contains solutions related to that specific topic/category.
📌 Topics need to cover
✅ Arrays & Strings
✅ Linked Lists
✅ Stacks & Queues
✅ Trees
✅ Graphs
✅ Recursion & Backtracking
✅ Sorting & Searching
✅ Dynamic Programming
✅ Miscellaneous Challenges
✏️ Naming Convention
Each file name corresponds to the problem title, and solutions are written in Python mainly.
✨ Future Goals Complete major DSA topics
Attempt 200+ DSA problems by [15 july 2025]
Start contributing to open-source DSA projects
| 0238-product-of-array-except-self |
| 1603-running-sum-of-1d-array |
| 1833-find-the-highest-altitude |
| 0566-reshape-the-matrix |
| 0657-robot-return-to-origin |
| 0861-flipping-an-image |
| 0898-transpose-matrix |
| 1505-create-target-array-in-the-given-order |
| 2058-concatenation-of-array |
| 0074-search-a-2d-matrix |
| 0566-reshape-the-matrix |
| 0861-flipping-an-image |
| 0898-transpose-matrix |
| 1476-count-negative-numbers-in-a-sorted-matrix |
| 1677-matrix-diagonal-sum |
| 1791-richest-customer-wealth |
| 0169-majority-element |
| 0347-top-k-frequent-elements |
| 1482-how-many-numbers-are-smaller-than-the-current-number |
| 1635-number-of-good-pairs |
| 1823-determine-if-string-halves-are-alike |
| 0136-single-number |
| 0268-missing-number |
| 0287-find-the-duplicate-number |
| 0861-flipping-an-image |
| 0004-median-of-two-sorted-arrays |
| 0169-majority-element |
| 0347-top-k-frequent-elements |
| 0028-find-the-index-of-the-first-occurrence-in-a-string |
| 0572-subtree-of-another-tree |
| 0686-repeated-string-match |
| 0020-valid-parentheses |
| 0143-reorder-list |
| 0150-evaluate-reverse-polish-notation |
| 0155-min-stack |
| 0234-palindrome-linked-list |
| 0883-car-fleet |
| 1078-remove-outermost-parentheses |
| 2128-reverse-prefix-of-word |
| 0002-add-two-numbers |
| 0021-merge-two-sorted-lists |
| 0143-reorder-list |
| 0203-remove-linked-list-elements |
| 0206-reverse-linked-list |
| 0234-palindrome-linked-list |
| 0155-min-stack |
| 0838-design-linked-list |
| 1023-time-based-key-value-store |
| 0883-car-fleet |
| 0347-top-k-frequent-elements |
| 0347-top-k-frequent-elements |
| 0347-top-k-frequent-elements |
| 0128-longest-consecutive-sequence |
| 0011-container-with-most-water |
| 0455-assign-cookies |
| 0100-same-tree |
| 0102-binary-tree-level-order-traversal |
| 0104-maximum-depth-of-binary-tree |
| 0110-balanced-binary-tree |
| 0226-invert-binary-tree |
| 0543-diameter-of-binary-tree |
| 0572-subtree-of-another-tree |
| 0100-same-tree |
| 0104-maximum-depth-of-binary-tree |
| 0110-balanced-binary-tree |
| 0226-invert-binary-tree |
| 0543-diameter-of-binary-tree |
| 0572-subtree-of-another-tree |
| 0100-same-tree |
| 0102-binary-tree-level-order-traversal |
| 0104-maximum-depth-of-binary-tree |
| 0226-invert-binary-tree |
| 0100-same-tree |
| 0102-binary-tree-level-order-traversal |
| 0104-maximum-depth-of-binary-tree |
| 0110-balanced-binary-tree |
| 0226-invert-binary-tree |
| 0543-diameter-of-binary-tree |
| 0572-subtree-of-another-tree |
| 0572-subtree-of-another-tree |