Skip to content
/ Daily-DSA-solution Public

Daily DSA Practice for FAANG/Product-Based Interviews This repository contains a comprehensive collection of Data Structures and Algorithms problems with solutions in Java, regularly practiced from platforms like LeetCode, Codeforces, GeeksforGeeks, and CodeChef.

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

Amanacer/Daily-DSA-solution

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

114 Commits
A tree of N nodes is given to you - find the number of valid paths (i,j) such that in the path from i to j only 1 node has prime number value on it.java
A tree of N nodes is given to you - find the number of valid paths (i,j) such that in the path from i to j only 1 node has prime number value on it.java
 
 
ColorComponentPairs.java
ColorComponentPairs.java
 
 
Count Almost Equal Pairs II.java
Count Almost Equal Pairs II.java
 
 
Dynamic Programming
Dynamic Programming
 
 
Find the cells from which you can reach cell G in 1 move..java
Find the cells from which you can reach cell G in 1 move..java
 
 
For each index i, it's counting how many prefixes [0..j] exist such that in that prefix there is at least one character that has occurred ≥ k times up to i..java
For each index i, it's counting how many prefixes [0..j] exist such that in that prefix there is at least one character that has occurred ≥ k times up to i..java
 
 
Fun Permutation.java
Fun Permutation.java
 
 
Given an array try to make it in a increasing array You have to do this in minimum number of operations.java
Given an array try to make it in a increasing array You have to do this in minimum number of operations.java
 
 
Max - Min Google OA.java
Max - Min Google OA.java
 
 
Max Difference You Can Get From Changing an Integer.java
Max Difference You Can Get From Changing an Integer.java
 
 
MaxBlueInShortestPath.java
MaxBlueInShortestPath.java
 
 
Maximize the Value in the Array.java
Maximize the Value in the Array.java
 
 
Maximum Difference Between Increasing Elements.java
Maximum Difference Between Increasing Elements.java
 
 
Microsoft OA _Sol.java
Microsoft OA _Sol.java
 
 
MinTotalVariance.java
MinTotalVariance.java
 
 
Monsters.java
Monsters.java
 
 
Optimal point selsction.java
Optimal point selsction.java
 
 
README.md
README.md
 
 
Selling a Menagerie(Topological sorting).java
Selling a Menagerie(Topological sorting).java
 
 
SubsetSumModuloK.java
SubsetSumModuloK.java
 
 
ValidPairsCounter.java
ValidPairsCounter.java
 
 
We will give you a string only consisting of “a” and “b” ; now convert it to a string such that there is no subset like “bab” or “aba” ; do this in minimum cost.java
We will give you a string only consisting of “a” and “b” ; now convert it to a string such that there is no subset like “bab” or “aba” ; do this in minimum cost.java
 
 
You have to maximize the consecutive integers count in array.java
You have to maximize the consecutive integers count in array.java
 
 
check if the subarray is good or not.java
check if the subarray is good or not.java
 
 
chid parent mapping.java
chid parent mapping.java
 
 
code (1).java
code (1).java
 
 
code.java
code.java
 
 
computeMex.java
computeMex.java
 
 
containsNearbyDuplicateOptimized.java
containsNearbyDuplicateOptimized.java
 
 
efficient selling binary search prblem.java
efficient selling binary search prblem.java
 
 
element occurs for K times.java
element occurs for K times.java
 
 
exor.java
exor.java
 
 
find the maximum sum subarray which has the same elements in the start and end..java
find the maximum sum subarray which has the same elements in the start and end..java
 
 
find the maximum sum subarray which has the same elements in the start and end.java
find the maximum sum subarray which has the same elements in the start and end.java
 
 
find the number of partitions to divide the whole array in 2 equal part.java
find the number of partitions to divide the whole array in 2 equal part.java
 
 
findSumNotDivByX.java
findSumNotDivByX.java
 
 
handle infection spread.java
handle infection spread.java
 
 
ideone_aA4wle.java
ideone_aA4wle.java
 
 
ideone_mk0Jf0.java
ideone_mk0Jf0.java
 
 
ideone_u6Msus.java
ideone_u6Msus.java
 
 
max sixe adding #.java
max sixe adding #.java
 
 
max_overlap_intervals.java
max_overlap_intervals.java
 
 
maximize subsequence count after allowed changes..java
maximize subsequence count after allowed changes..java
 
 
maximum v shape height in tree.java
maximum v shape height in tree.java
 
 
messho oa sol.java
messho oa sol.java
 
 
monica and dishes.java
monica and dishes.java
 
 
multiset.java
multiset.java
 
 
partitionArray.java
partitionArray.java
 
 
police-stations-de-shaw-oa.java
police-stations-de-shaw-oa.java
 
 
pq.java
pq.java
 
 
print if freq is greater than 1 (Axios Bank OA).java
print if freq is greater than 1 (Axios Bank OA).java
 
 
range.java
range.java
 
 
shortest path 1 (Google).java
shortest path 1 (Google).java
 
 
smart gardener(DP).java
smart gardener(DP).java
 
 
subarrays from it which are non-intersecting and their final sum should be maximum.java
subarrays from it which are non-intersecting and their final sum should be maximum.java
 
 
topological sorting.java
topological sorting.java
 
 
uber OA Sol.java
uber OA Sol.java
 
 

Repository files navigation

🚀 Daily DSA Solution Repository

🔥 Your one-stop daily destination to master Data Structures & Algorithms! 🔥
Consistency + Practice = Success 🏆

📌 About This Repo

Welcome to the Daily DSA Solution repository – a collection of daily practice problems covering:

  • 📂 Data Structures: Arrays, Trees, Graphs, Heaps, Linked Lists, Tries, Stacks, Queues
  • ⚙️ Algorithms: Sorting, Searching, Dynamic Programming, Backtracking, Greedy
  • 🧠 Advanced Topics: Tree DP, DFS + HashMap Tricks, Prime Sieve Optimizations
  • 💡 Platforms Covered: LeetCode, GFG, CodeStudio, Codeforces, AtCoder

📈 Repo Highlights


  • 📅 Daily Updates
  • ✅ Fully compiled + tested solutions
  • 🔍 Cleanly structured folders
  • 🧩 Optimized logic and explanations in code comments
  • 🔥 800+ hours invested for mastering DSA

📁 Folder Structure

Daily-DSA-Solution/ │ ├── Day_01/ │ ├── Problem1.java │ ├── Problem2.java │ ├── Day_02/ │ ├── GraphProblem.java │ ├── TreeDP.java │ ├── ... │ └── README.md

🎯 Goals of this Repo

  • 📌 Crack FAANG, Product-Based Companies
  • 🚀 Build strong problem-solving skills
  • 💯 Achieve top ranks in LeetCode & CodeChef
  • 📖 Revision-friendly format with clean code

🧮 GitHub Stats

🧑‍💻 Maintainer yaml Copy Edit Name: Aman Singh Role: Aspiring SDE | Java DSA Expert | MERN Developer College: IMS Engineering College, Ghaziabad

💬 Connect / Collaborate Want to collaborate or learn together? Drop a ⭐ and raise an issue! Together we grow 💪 📸 3D GitHub Profile (optional)

snake gif

📌 Star History

🚀 Let's crack DSA, one problem at a time! 🚀

```

About

Daily DSA Practice for FAANG/Product-Based Interviews This repository contains a comprehensive collection of Data Structures and Algorithms problems with solutions in Java, regularly practiced from platforms like LeetCode, Codeforces, GeeksforGeeks, and CodeChef.

Resources

Readme
Activity

Stars

1 star

Watchers

0 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages