Skip to content
/ GFG-160-Days-DSA-Challenge Public

🚀 Currently solving the GFG 160 Days DSA Challenge with Java — committing one problem a day, complete with clean solutions and markdown explanations. This is a live repository that's constantly evolving as I progress through the challenge. Follow along or fork it to start your own grind! 💻🔥

1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

milanh34/GFG-160-Days-DSA-Challenge

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

162 Commits
Day 001 - Second Largest (Arrays).md
Day 001 - Second Largest (Arrays).md
 
 
Day 002 - Move All Zeroes to End (Arrays).md
Day 002 - Move All Zeroes to End (Arrays).md
 
 
Day 003 - Reverse an Array (Arrays).md
Day 003 - Reverse an Array (Arrays).md
 
 
Day 004 - Rotate Array (Arrays).md
Day 004 - Rotate Array (Arrays).md
 
 
Day 005 - Next Permutation (Arrays).md
Day 005 - Next Permutation (Arrays).md
 
 
Day 006 - Majority Element II (Arrays).md
Day 006 - Majority Element II (Arrays).md
 
 
Day 007 - Stock Buy and Sell – Multiple Transaction Allowed (Arrays).md
Day 007 - Stock Buy and Sell – Multiple Transaction Allowed (Arrays).md
 
 
Day 008 - Stock Buy and Sell – Max one Transaction Allowed (Arrays).md
Day 008 - Stock Buy and Sell – Max one Transaction Allowed (Arrays).md
 
 
Day 009 - Minimize the Heights II (Arrays).md
Day 009 - Minimize the Heights II (Arrays).md
 
 
Day 010 - Kadane's Algorithm (Arrays).md
Day 010 - Kadane's Algorithm (Arrays).md
 
 
Day 011 - Maximum Product Subarray (Arrays).md
Day 011 - Maximum Product Subarray (Arrays).md
 
 
Day 012 - Max Circular Subarray Sum (Arrays).md
Day 012 - Max Circular Subarray Sum (Arrays).md
 
 
Day 013 - Smallest Positive Missing (Arrays).md
Day 013 - Smallest Positive Missing (Arrays).md
 
 
Day 014 - Implement Atoi (String).md
Day 014 - Implement Atoi (String).md
 
 
Day 015 - Add Binary Strings (String).md
Day 015 - Add Binary Strings (String).md
 
 
Day 016 - Anagram (String).md
Day 016 - Anagram (String).md
 
 
Day 017 - Non Repeating Character (String).md
Day 017 - Non Repeating Character (String).md
 
 
Day 018 - Search Pattern (KMP-Algorithm) (String).md
Day 018 - Search Pattern (KMP-Algorithm) (String).md
 
 
Day 019 - Min Chars to Add for Palindrome (String).md
Day 019 - Min Chars to Add for Palindrome (String).md
 
 
Day 020 - Strings Rotations of Each Other (String).md
Day 020 - Strings Rotations of Each Other (String).md
 
 
Day 021 - Sort 0s, 1s and 2s (Sorting).md
Day 021 - Sort 0s, 1s and 2s (Sorting).md
 
 
Day 022 - Find H-Index (Sorting).md
Day 022 - Find H-Index (Sorting).md
 
 
Day 023 - Count Inversions (Sorting).md
Day 023 - Count Inversions (Sorting).md
 
 
Day 024 - Overlapping Intervals (Sorting).md
Day 024 - Overlapping Intervals (Sorting).md
 
 
Day 025 - Insert Interval (Sorting).md
Day 025 - Insert Interval (Sorting).md
 
 
Day 026 - Non-overlapping Intervals (Sorting).md
Day 026 - Non-overlapping Intervals (Sorting).md
 
 
Day 027 - Merge Without Extra Space (Sorting).md
Day 027 - Merge Without Extra Space (Sorting).md
 
 
Day 028 - Number of occurrence (Searching).md
Day 028 - Number of occurrence (Searching).md
 
 
Day 029 - Sorted and Rotated Minimum (Searching).md
Day 029 - Sorted and Rotated Minimum (Searching).md
 
 
Day 030 - Search in Rotated Sorted Array (Searching).md
Day 030 - Search in Rotated Sorted Array (Searching).md
 
 
Day 031 - Peak element (Searching).md
Day 031 - Peak element (Searching).md
 
 
Day 032 - K-th element of two Arrays (Searching).md
Day 032 - K-th element of two Arrays (Searching).md
 
 
Day 033 - Aggressive Cows (Searching).md
Day 033 - Aggressive Cows (Searching).md
 
 
Day 034 - Allocate Minimum Pages (Searching).md
Day 034 - Allocate Minimum Pages (Searching).md
 
 
Day 035 - Kth Missing Positive Number in a Sorted Array (Searching).md
Day 035 - Kth Missing Positive Number in a Sorted Array (Searching).md
 
 
Day 036 - Spirally traversing a matrix (Matrix).md
Day 036 - Spirally traversing a matrix (Matrix).md
 
 
Day 037 - Rotate by 90 degree (Matrix).md
Day 037 - Rotate by 90 degree (Matrix).md
 
 
Day 038 - Search in a Row-Column sorted matrix (Matrix).md
Day 038 - Search in a Row-Column sorted matrix (Matrix).md
 
 
Day 039 - Search in a row-wise sorted matrix (Matrix).md
Day 039 - Search in a row-wise sorted matrix (Matrix).md
 
 
Day 040 - Search in a sorted Matrix (Matrix).md
Day 040 - Search in a sorted Matrix (Matrix).md
 
 
Day 041 - Set Matrix Zeroes (Matrix).md
Day 041 - Set Matrix Zeroes (Matrix).md
 
 
Day 042 - Two Sum - Pair with Given Sum (Hashing).md
Day 042 - Two Sum - Pair with Given Sum (Hashing).md
 
 
Day 043 - Count pairs with given sum (Hashing).md
Day 043 - Count pairs with given sum (Hashing).md
 
 
Day 044 - Find All Triplets with Zero Sum (Hashing).md
Day 044 - Find All Triplets with Zero Sum (Hashing).md
 
 
Day 045 - Intersection of Two arrays with Duplicate Elements (Hashing).md
Day 045 - Intersection of Two arrays with Duplicate Elements (Hashing).md
 
 
Day 046 - Union of Arrays with Duplicates (Hashing).md
Day 046 - Union of Arrays with Duplicates (Hashing).md
 
 
Day 047 - Longest Consecutive Subsequence (Hashing).md
Day 047 - Longest Consecutive Subsequence (Hashing).md
 
 
Day 048 - Print Anagrams Together (Hashing).md
Day 048 - Print Anagrams Together (Hashing).md
 
 
Day 049 - Subarrays with sum K (Hashing).md
Day 049 - Subarrays with sum K (Hashing).md
 
 
Day 050 - Count Subarrays with given XOR (Hashing).md
Day 050 - Count Subarrays with given XOR (Hashing).md
 
 
Day 051 - Count all triplets with given sum in sorted array (Two Pointer Technique).md
Day 051 - Count all triplets with given sum in sorted array (Two Pointer Technique).md
 
 
Day 052 - Count Pairs whose sum is less than target (Two Pointer Technique).md
Day 052 - Count Pairs whose sum is less than target (Two Pointer Technique).md
 
 
Day 053 - Sum Pair closest to target (Two Pointer Technique).md
Day 053 - Sum Pair closest to target (Two Pointer Technique).md
 
 
Day 054 - Pair with given sum in a sorted array (Two Pointer Technique).md
Day 054 - Pair with given sum in a sorted array (Two Pointer Technique).md
 
 
Day 055 - Count the number of possible triangles (Two Pointer Technique).md
Day 055 - Count the number of possible triangles (Two Pointer Technique).md
 
 
Day 056 - Indexes of Subarray Sum (Two Pointer Technique).md
Day 056 - Indexes of Subarray Sum (Two Pointer Technique).md
 
 
Day 057 - Count distinct elements in every window (Two Pointer Technique).md
Day 057 - Count distinct elements in every window (Two Pointer Technique).md
 
 
Day 058 - Longest substring with distinct characters (Two Pointer Technique).md
Day 058 - Longest substring with distinct characters (Two Pointer Technique).md
 
 
Day 059 - Trapping Rain Water (Two Pointer Technique).md
Day 059 - Trapping Rain Water (Two Pointer Technique).md
 
 
Day 060 - Container With Most Water (Two Pointer Technique).md
Day 060 - Container With Most Water (Two Pointer Technique).md
 
 
Day 061 - Equilibrium Point (Prefix Sum).md
Day 061 - Equilibrium Point (Prefix Sum).md
 
 
Day 062 - Longest Subarray with Sum K (Prefix Sum).md
Day 062 - Longest Subarray with Sum K (Prefix Sum).md
 
 
Day 063 - Largest subarray of 0's and 1's (Prefix Sum).md
Day 063 - Largest subarray of 0's and 1's (Prefix Sum).md
 
 
Day 064 - Product array puzzle (Prefix Sum).md
Day 064 - Product array puzzle (Prefix Sum).md
 
 
Day 065 - Reverse a linked list (Linked List).md
Day 065 - Reverse a linked list (Linked List).md
 
 
Day 066 - Rotate a Linked List (Linked List).md
Day 066 - Rotate a Linked List (Linked List).md
 
 
Day 067 - Merge two sorted linked lists (Linked List).md
Day 067 - Merge two sorted linked lists (Linked List).md
 
 
Day 068 - Linked List Group Reverse (Linked List).md
Day 068 - Linked List Group Reverse (Linked List).md
 
 
Day 069 - Add Number Linked Lists (Linked List).md
Day 069 - Add Number Linked Lists (Linked List).md
 
 
Day 070 - Clone List with Next and Random (Linked List).md
Day 070 - Clone List with Next and Random (Linked List).md
 
 
Day 071 - Detect Loop in linked list (Linked List).md
Day 071 - Detect Loop in linked list (Linked List).md
 
 
Day 072 - Find the first node of loop in linked list (Linked List).md
Day 072 - Find the first node of loop in linked list (Linked List).md
 
 
Day 073 - Remove loop in Linked List (Linked List).md
Day 073 - Remove loop in Linked List (Linked List).md
 
 
Day 074 - LRU Cache (Linked List).md
Day 074 - LRU Cache (Linked List).md
 
 
Day 075 - Permutations of a String (Recursion and Backtracking).md
Day 075 - Permutations of a String (Recursion and Backtracking).md
 
 
Day 076 - Implement Pow (Recursion and Backtracking).md
Day 076 - Implement Pow (Recursion and Backtracking).md
 
 
Day 077 - N-Queen Problem (Recursion and Backtracking).md
Day 077 - N-Queen Problem (Recursion and Backtracking).md
 
 
Day 078 - Solve the Sudoku (Recursion and Backtracking).md
Day 078 - Solve the Sudoku (Recursion and Backtracking).md
 
 
Day 079 - Word Search (Recursion and Backtracking).md
Day 079 - Word Search (Recursion and Backtracking).md
 
 
Day 080 - Level order traversal (Tree).md
Day 080 - Level order traversal (Tree).md
 
 
Day 081 - Height of Binary Tree (Tree).md
Day 081 - Height of Binary Tree (Tree).md
 
 
Day 082 - Diameter of a Binary Tree (Tree).md
Day 082 - Diameter of a Binary Tree (Tree).md
 
 
Day 083 - Mirror Tree (Tree).md
Day 083 - Mirror Tree (Tree).md
 
 
Day 084 - Construct Tree from Inorder & Preorder (Tree).md
Day 084 - Construct Tree from Inorder & Preorder (Tree).md
 
 
Day 085 - Inorder Traversal (Tree).md
Day 085 - Inorder Traversal (Tree).md
 
 
Day 086 - Tree Boundary Traversal (Tree).md
Day 086 - Tree Boundary Traversal (Tree).md
 
 
Day 087 - Maximum path sum from any node (Tree).md
Day 087 - Maximum path sum from any node (Tree).md
 
 
Day 088 - K Sum Paths (Tree).md
Day 088 - K Sum Paths (Tree).md
 
 
Day 089 - Check for BST (Tree).md
Day 089 - Check for BST (Tree).md
 
 
Day 090 - k-th Smallest in BST (Trree).md
Day 090 - k-th Smallest in BST (Trree).md
 
 
Day 091 - Pair Sum in BST (Tree).md
Day 091 - Pair Sum in BST (Tree).md
 
 
Day 092 - Fixing Two nodes of a BST (Tree).md
Day 092 - Fixing Two nodes of a BST (Tree).md
 
 
Day 093 - Lowest Common Ancestor in a BST (Tree).md
Day 093 - Lowest Common Ancestor in a BST (Tree).md
 
 
Day 094 - Serialize and deserialize a binary tree (Tree).md
Day 094 - Serialize and deserialize a binary tree (Tree).md
 
 
Day 095 - k largest elements (Heap).md
Day 095 - k largest elements (Heap).md
 
 
Day 096 - K Closest Points to Origin (Heap).md
Day 096 - K Closest Points to Origin (Heap).md
 
 
Day 097 - Merge K sorted linked lists (Heap).md
Day 097 - Merge K sorted linked lists (Heap).md
 
 
Day 098 - Find median in a stream (Heap).md
Day 098 - Find median in a stream (Heap).md
 
 
Day 099 - Parenthesis Checker (Stack).md
Day 099 - Parenthesis Checker (Stack).md
 
 
Day 100 - Longest valid Parentheses (Stack).md
Day 100 - Longest valid Parentheses (Stack).md
 
 

Repository files navigation

🚀 GFG 160 Days DSA Challenge

Welcome to my live repository for the GeeksforGeeks 160 Days DSA Challenge — a fun and focused journey where I’m solving handpicked DSA problems daily in Java 🧑‍💻. Each solution comes with clean Java code and detailed markdown explanations. I'm actively updating this repo every day, so whether you’re prepping for interviews, revising DSA, or building a problem-solving habit — you’re in the right place! 🌱💡

GFG Challenge

📌 Why Follow This Challenge?

  • 💡 Strengthen your DSA concepts from basics to advanced
  • 👨‍💻 Practice clean and optimized Java code
  • 📖 Understand the “why” behind each approach with clear markdowns
  • 🚀 Prepare effectively for coding interviews
  • 🧠 Build discipline through daily problem solving

🔄 Status

  • 🔥 In Progress: Daily uploads
  • ✅ Language: Java
  • 📝 Format: Problem description, approach, constraints, complexities, and code

🌟 If You Like This Repo

  • ⭐ Star to support this effort
  • 🍴 Fork to solve along with me
  • 🔔 Watch for daily updates
  • 📢 Share with fellow learners!

📲 Let’s Connect

Feel free to reach out or follow my journey:

Made with ❤️ by Milan Haria

About

🚀 Currently solving the GFG 160 Days DSA Challenge with Java — committing one problem a day, complete with clean solutions and markdown explanations. This is a live repository that's constantly evolving as I progress through the challenge. Follow along or fork it to start your own grind! 💻🔥

Topics

java algorithms solutions competitive-programming data-structures data-structures-algorithms dsa geeksforgeeks-solutions data-structure-java data-structure-and-algorithm data-structures-and-algorithms geeksforgeeks-java geeksforgeeks-dsa geeksforgeeks-practice gfg-solutions gfg-questions dsa-java gfg-java gfg-practice gfg-160

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published