Skip to content

AruneshBasak/Python-DSA-Problems-GeeksforGeeks-160-Days

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

77 Commits
Day 1 - Second Largest.py
Day 1 - Second Largest.py
 
 
Day 10 - Kadane's Algorithm.py
Day 10 - Kadane's Algorithm.py
 
 
Day 11 - Maximum Product Subarray.py
Day 11 - Maximum Product Subarray.py
 
 
Day 12 - Max Circular Subarray Sum.py
Day 12 - Max Circular Subarray Sum.py
 
 
Day 13 - Smallest Positive Missing Number.py
Day 13 - Smallest Positive Missing Number.py
 
 
Day 14 - Implement Atoi.py
Day 14 - Implement Atoi.py
 
 
Day 15 - Add Binary Strings.py
Day 15 - Add Binary Strings.py
 
 
Day 16 - Anagram.py
Day 16 - Anagram.py
 
 
Day 17 - Non Repeating Character.py
Day 17 - Non Repeating Character.py
 
 
Day 18 - Search Pattern (KMP-Algorithm).py
Day 18 - Search Pattern (KMP-Algorithm).py
 
 
Day 19 - Min Chars to Add for Palindrome.py
Day 19 - Min Chars to Add for Palindrome.py
 
 
Day 2 - Move All Zeroes to End.py
Day 2 - Move All Zeroes to End.py
 
 
Day 20 - Strings Rotations of Each Other.py
Day 20 - Strings Rotations of Each Other.py
 
 
Day 21 - Sort 0s, 1s and 2s.py
Day 21 - Sort 0s, 1s and 2s.py
 
 
Day 22 - Find H-Index.py
Day 22 - Find H-Index.py
 
 
Day 23 - Count Inversions.py
Day 23 - Count Inversions.py
 
 
Day 24 - Overlapping Intervals.py
Day 24 - Overlapping Intervals.py
 
 
Day 25 - Insert Interval.py
Day 25 - Insert Interval.py
 
 
Day 26 - Non-overlapping Intervals.py
Day 26 - Non-overlapping Intervals.py
 
 
Day 27 - Merge Without Extra Space.py
Day 27 - Merge Without Extra Space.py
 
 
Day 28 - Number of occurrence.py
Day 28 - Number of occurrence.py
 
 
Day 29 - Sorted and Rotated Minimum.py
Day 29 - Sorted and Rotated Minimum.py
 
 
Day 3 - Reverse an Array.py
Day 3 - Reverse an Array.py
 
 
Day 30 - Search in Rotated Sorted Array.py
Day 30 - Search in Rotated Sorted Array.py
 
 
Day 31 - Peak element.py
Day 31 - Peak element.py
 
 
Day 32 - K-th element of two Arrays.py
Day 32 - K-th element of two Arrays.py
 
 
Day 33 - Aggressive Cows.py
Day 33 - Aggressive Cows.py
 
 
Day 34 - Allocate Minimum Pages.py
Day 34 - Allocate Minimum Pages.py
 
 
Day 35 - Kth Missing Positive Number in a Sorted Array.py
Day 35 - Kth Missing Positive Number in a Sorted Array.py
 
 
Day 36 - Spirally traversing a matrix.py
Day 36 - Spirally traversing a matrix.py
 
 
Day 37 - Rotate by 90 degree.py
Day 37 - Rotate by 90 degree.py
 
 
Day 38 - Search in a Row-Column sorted matrix.py
Day 38 - Search in a Row-Column sorted matrix.py
 
 
Day 39 - Search in a row-wise sorted matrix.py
Day 39 - Search in a row-wise sorted matrix.py
 
 
Day 4 - Rotate Array.py
Day 4 - Rotate Array.py
 
 
Day 40 - Search in a sorted Matrix.py
Day 40 - Search in a sorted Matrix.py
 
 
Day 41 - Set Matrix Zeroes.py
Day 41 - Set Matrix Zeroes.py
 
 
Day 5 - Next Permutation.py
Day 5 - Next Permutation.py
 
 
Day 6 - Majority Element II.py
Day 6 - Majority Element II.py
 
 
Day 7 - Stock Buy and Sell – Multiple Transaction Allowed.py
Day 7 - Stock Buy and Sell – Multiple Transaction Allowed.py
 
 
Day 7 - Strings Rotations of Each Other.py
Day 7 - Strings Rotations of Each Other.py
 
 
Day 8 - Stock Buy and Sell – Max one Transaction Allowed.py
Day 8 - Stock Buy and Sell – Max one Transaction Allowed.py
 
 
Day 9 - Minimize the Heights II.py
Day 9 - Minimize the Heights II.py
 
 
README.md
README.md
 
 

Repository files navigation

Python-DSA-Problems-GeeksforGeeks-160-Days

A 160-day journey of solving Data Structures and Algorithms (DSA) problems from GeeksforGeeks using Python.
This repository documents my daily practice, problem-solving approach, and solutions in Python to strengthen problem-solving and algorithmic thinking.

📖 About

This repository is a personal challenge where I solve DSA problems daily for 160 days.
The goal is to master fundamental and advanced topics in data structures and algorithms through consistent practice.

Each solution is written in Python and organized for easy reference, so learners and contributors can follow along.

🚀 Features

  • 📅 Daily Problem Solving — One or more problems solved each day
  • 🐍 Python Solutions — Clear, well-structured, and optimized Python code
  • 📚 Topic Coverage — Covers core DSA concepts such as:
    • Arrays & Strings
    • Linked Lists
    • Stacks & Queues
    • Recursion & Backtracking
    • Trees & Graphs
    • Dynamic Programming
    • Greedy Algorithms
    • Searching & Sorting
    • Hashing & Maps
  • 📝 Code + Explanation — Each solution includes comments for clarity
  • 🔄 Daily Updates — Repository grows day by day until 160-day challenge completion

🛠️ Tech Stack

  • Language: Python 3
  • Platform: GeeksforGeeks problem sets
  • Tools: VS Code / Jupyter Notebook

Clone this repository:

git clone https://github.com/your-username/Python-DSA-Problems-GeeksforGeeks-160-Days.git
cd Python-DSA-Problems-GeeksforGeeks-160-Days

About

A 160-day Python challenge solving GeeksforGeeks DSA problems daily — covering arrays, strings, recursion, dynamic programming, trees, graphs, and more with clean, well-explained solutions. I will upload my daily Python DSA problems solved on GeeksforGeeks and post it here!

Topics

python data structure python3 data-structures and dsa algorithms-and-data-structures

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages