Skip to content

murali317/DSA_Python

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

259 Commits
1-two-sum
1-two-sum
 
 
101-symmetric-tree
101-symmetric-tree
 
 
1013-fibonacci-number
1013-fibonacci-number
 
 
1016-subarray-sums-divisible-by-k
1016-subarray-sums-divisible-by-k
 
 
102-binary-tree-level-order-traversal
102-binary-tree-level-order-traversal
 
 
104-maximum-depth-of-binary-tree
104-maximum-depth-of-binary-tree
 
 
11-container-with-most-water
11-container-with-most-water
 
 
112-path-sum
112-path-sum
 
 
1127-last-stone-weight
1127-last-stone-weight
 
 
121-best-time-to-buy-and-sell-stock
121-best-time-to-buy-and-sell-stock
 
 
122-best-time-to-buy-and-sell-stock-ii
122-best-time-to-buy-and-sell-stock-ii
 
 
125-valid-palindrome
125-valid-palindrome
 
 
13-roman-to-integer
13-roman-to-integer
 
 
14-longest-common-prefix
14-longest-common-prefix
 
 
141-linked-list-cycle
141-linked-list-cycle
 
 
142-linked-list-cycle-ii
142-linked-list-cycle-ii
 
 
144-binary-tree-preorder-traversal
144-binary-tree-preorder-traversal
 
 
145-binary-tree-postorder-traversal
145-binary-tree-postorder-traversal
 
 
15-3sum
15-3sum
 
 
153-find-minimum-in-rotated-sorted-array
153-find-minimum-in-rotated-sorted-array
 
 
155-min-stack
155-min-stack
 
 
160-intersection-of-two-linked-lists
160-intersection-of-two-linked-lists
 
 
1603-running-sum-of-1d-array
1603-running-sum-of-1d-array
 
 
167-two-sum-ii-input-array-is-sorted
167-two-sum-ii-input-array-is-sorted
 
 
169-majority-element
169-majority-element
 
 
18-4sum
18-4sum
 
 
19-remove-nth-node-from-end-of-list
19-remove-nth-node-from-end-of-list
 
 
198-house-robber
198-house-robber
 
 
20-valid-parentheses
20-valid-parentheses
 
 
205-isomorphic-strings
205-isomorphic-strings
 
 
206-reverse-linked-list
206-reverse-linked-list
 
 
209-minimum-size-subarray-sum
209-minimum-size-subarray-sum
 
 
213-house-robber-ii
213-house-robber-ii
 
 
225-implement-stack-using-queues
225-implement-stack-using-queues
 
 
226-invert-binary-tree
226-invert-binary-tree
 
 
23-merge-k-sorted-lists
23-merge-k-sorted-lists
 
 
232-implement-queue-using-stacks
232-implement-queue-using-stacks
 
 
235-lowest-common-ancestor-of-a-binary-search-tree
235-lowest-common-ancestor-of-a-binary-search-tree
 
 
236-lowest-common-ancestor-of-a-binary-tree
236-lowest-common-ancestor-of-a-binary-tree
 
 
238-product-of-array-except-self
238-product-of-array-except-self
 
 
239-sliding-window-maximum
239-sliding-window-maximum
 
 
242-valid-anagram
242-valid-anagram
 
 
2552-maximum-sum-of-distinct-subarrays-with-length-k
2552-maximum-sum-of-distinct-subarrays-with-length-k
 
 
2605-count-anagrams
2605-count-anagrams
 
 
27-remove-element
27-remove-element
 
 
278-first-bad-version
278-first-bad-version
 
 
283-move-zeroes
283-move-zeroes
 
 
297-serialize-and-deserialize-binary-tree
297-serialize-and-deserialize-binary-tree
 
 
3-longest-substring-without-repeating-characters
3-longest-substring-without-repeating-characters
 
 
344-reverse-string
344-reverse-string
 
 
347-top-k-frequent-elements
347-top-k-frequent-elements
 
 
42-trapping-rain-water
42-trapping-rain-water
 
 
450-delete-node-in-a-bst
450-delete-node-in-a-bst
 
 
49-group-anagrams
49-group-anagrams
 
 
496-next-greater-element-i
496-next-greater-element-i
 
 
5-longest-palindromic-substring
5-longest-palindromic-substring
 
 
523-continuous-subarray-sum
523-continuous-subarray-sum
 
 
53-maximum-subarray
53-maximum-subarray
 
 
543-diameter-of-binary-tree
543-diameter-of-binary-tree
 
 
547-number-of-provinces
547-number-of-provinces
 
 
56-merge-intervals
56-merge-intervals
 
 
560-subarray-sum-equals-k
560-subarray-sum-equals-k
 
 
61-rotate-list
61-rotate-list
 
 
62-unique-paths
62-unique-paths
 
 
63-unique-paths-ii
63-unique-paths-ii
 
 
64-minimum-path-sum
64-minimum-path-sum
 
 
643-maximum-average-subarray-i
643-maximum-average-subarray-i
 
 
680-valid-palindrome-ii
680-valid-palindrome-ii
 
 
69-sqrtx
69-sqrtx
 
 
70-climbing-stairs
70-climbing-stairs
 
 
713-subarray-product-less-than-k
713-subarray-product-less-than-k
 
 
739-daily-temperatures
739-daily-temperatures
 
 
747-min-cost-climbing-stairs
747-min-cost-climbing-stairs
 
 
76-minimum-window-substring
76-minimum-window-substring
 
 
784-insert-into-a-binary-search-tree
784-insert-into-a-binary-search-tree
 
 
8-string-to-integer-atoi
8-string-to-integer-atoi
 
 
80-remove-duplicates-from-sorted-array-ii
80-remove-duplicates-from-sorted-array-ii
 
 
83-remove-duplicates-from-sorted-list
83-remove-duplicates-from-sorted-list
 
 
88-merge-sorted-array
88-merge-sorted-array
 
 
907-koko-eating-bananas
907-koko-eating-bananas
 
 
92-reverse-linked-list-ii
92-reverse-linked-list-ii
 
 
94-binary-tree-inorder-traversal
94-binary-tree-inorder-traversal
 
 
0 - 1 Knapsack - GFG
0 - 1 Knapsack - GFG
 
 
BFS of Graph - GFG
BFS of Graph - GFG
 
 
Connected Components in Undirected Graph (DFS) - GFG
Connected Components in Undirected Graph (DFS) - GFG
 
 
Connected Components in Undirected Graph (DSU) - GFG
Connected Components in Undirected Graph (DSU) - GFG
 
 
DFS of Graph - GFG
DFS of Graph - GFG
 
 
Directed Graph Cycle - GFG
Directed Graph Cycle - GFG
 
 
Directed Graph Cycle using KAHN'S algorithm - GFG
Directed Graph Cycle using KAHN'S algorithm - GFG
 
 
Fractional Knapsack - GFG
Fractional Knapsack - GFG
 
 
Minimum number of platforms required - GFG
Minimum number of platforms required - GFG
 
 
README.md
README.md
 
 
Subset Sum - GFG
Subset Sum - GFG
 
 
Topological Sort (DFS, BFS) - GFG
Topological Sort (DFS, BFS) - GFG
 
 
Undirected Graph Cycle - GFG
Undirected Graph Cycle - GFG
 
 

Repository files navigation

🧠 DSA Mastery — Solved Data Structures & Algorithms Problems

Welcome to my personal repository where I solve and document Data Structures & Algorithms (DSA) problems using Python. This repo tracks my journey towards cracking top product-based companies like Google, Amazon, Meta, Microsoft, and beyond.

🚀 What's Inside

  • 📚 Well-structured solutions to hundreds of DSA problems

  • 🧩 Categorized by data structure and algorithmic pattern

  • ✅ Clean, readable code with inline explanations

  • 💡 Covers core topics and frequently asked interview questions

    🎯 The Goal

  • Master DSA to confidently crack coding rounds at Tier-1 tech companies

  • Build algorithmic thinking and improve problem-solving speed

  • Maintain a clean, scalable repo that helps others learn as well

🛠 Tech Stack

📫 Connect With Me

About

🌟 Solved DSA problems with explained Intuition & Complexities in Python.

Resources

Readme
Activity

Stars

1 star

Watchers

0 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages