Skip to content

A collection of DSA solutions I’ve documented during my learning journey. While I’ve solved many more problems, these are the ones I found worth noting—either because they were challenging, interesting, or taught me something important. My journey is still ongoing, and this repo will continue to grow.

Notifications You must be signed in to change notification settings

AliAbdullahpgr/dsa-markdown-solutions

Repository files navigation

📚 DSA Solutions in Markdown

This repository contains my solutions to Data Structures & Algorithms problems — all documented in Markdown for easy reading, searching, and revising.

Each solution includes:

  • Problem Name
  • Difficulty
  • Tags / Topics
  • Time Taken
  • Date Solved
  • (Optional) Code snippet inside fenced code blocks

🏆 Progress Overview

Status Problem Difficulty Tags Time Taken Date
Binary Search Easy array, binary search 20-25 min 13-Aug-25
Search in Rotated Sorted Array Medium array, binary search 20-25 min 13-Aug-25
Find Minimum in Rotated Sorted Array Medium array, binary search 25 min 13-Aug-25
Kth Smallest Element in a BST Medium bfs, bst, stack/queue 1-Aug-25
Maximum Depth of Binary Tree Easy bfs, binary tree 10-20 min 25-Jul-25
Binary Tree Level Order Traversal Medium bfs, binary tree 10-20 min 25-Jul-25
Reverse Nodes in K-Group Hard linked list 20-25 min 25-Jul-25
Merge K Sorted Lists Hard heap, linked list 1h+ 22-Jul-25
Maximum Twin Sum of a Linked List Medium linked list, stack/queue 10-20 min 22-Jul-25
Add Two Numbers Medium linked list, math 10-20 min 22-Jul-25
... ... ... ... ... ...

📌 Categories

Arrays

  • Binary Search
  • Search in Rotated Sorted Array
  • Find Minimum in Rotated Sorted Array
  • Trapping Rainwater
  • Move Zeroes
  • Rotate Array
  • Merge Sorted Array
  • ...

Linked Lists

  • Reverse Linked List
  • Merge Two Sorted Linked Lists
  • Remove Nth Node From End
  • Copy List with Random Pointer
  • Linked List Cycle
  • Reorder List
  • ...

Trees

  • Maximum Depth of Binary Tree
  • Binary Tree Level Order Traversal
  • Kth Smallest Element in a BST
  • ...

Graphs

  • ...

Dynamic Programming

  • Best Time to Buy and Sell Stocks
  • ...

🎯 How to Navigate

  • Each solution is stored as a Markdown file in the relevant topic folder.
  • Click the problem name in the table to open its Markdown file.
  • Search this README using Ctrl+F to quickly find a problem.

🚀 Goals

  • Solve at least 500+ problems in total.
  • Maintain consistency with daily commits.
  • Improve time complexity & space optimization skills.

Star this repository to follow my DSA journey!

About

A collection of DSA solutions I’ve documented during my learning journey. While I’ve solved many more problems, these are the ones I found worth noting—either because they were challenging, interesting, or taught me something important. My journey is still ongoing, and this repo will continue to grow.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published