Welcome to the Java_With_DSA GitHub repository! This is where I embark on a 🌟 100-day DSA (Data Structures and Algorithms) challenge 🌟 with Java, pushing new questions and answers daily. Dive in with me as we explore various DSA problems, enhancing our Java skills and preparing for interviews along the way!
Below is the journey we'll take, one day at a time, through the fascinating world of data structures and algorithms.
- Day 1: 🐭 Rat in a Maze
- Day 2: 📱 KeyPad Combination
- Day 3: ♞ Knight's Tour
- Day 4: 💧 Container with Max Water
- Day 5: 🚶♂️ Lonely Number in a List
- Day 6: 🔺 Polygon with Largest Perimeter
- Day 7: 🔢 Least Number of Unique Integers
- Day 8: 🔄 Rotate Array
- Day 9: 📈 Buy and Sell Stocks
- Day 10: 🎮 Game with String
- Day 11: 💰 Max Sum of Subarray (Kadane's Algorithm)
- Day 12: 🔗 Bitwise AND (&) Operation in a Given Range
- Day 13: 🔍 Search In Sorted Rotated Array
- Day 14: 🌎 Group Anagrams
- Day 15: 📚 Valid Parenthesis
- Day 16: 🔗 Longest Common Prefix
- Day 17: 📝 String Subsequences
- Day 18: 🔖 Subsequences with sum K
- Day 19: 🔀 Merge Sort
- Day 20: 🧵 Convert Array into Linked List
- Day 21: 🏔️ Peak Element
- Day 22: 📫 First element to occur at K times
- Day 23: 📌 Remove nth Node from Last
- Day 24: 📥 Insert at Head and Last postion in Linked list
- Day 25: 📥 Insert at given index and after a given val in Linked list
- Day 26: 💥 Deletion in Linked List(from scratch)
- Day 27: 🎯 Find Mid of Linked List
- Day 28: 📚 Implement Queue using stacks
- Day 29: 🔗 Convert Array into Doubly Linked List
- Day 30: 🔢 Remove duplicate characters from string
- Day 31: 🔢 Custom Sort String
- Day 32: 💥 Print Pattern
- Day 33: 📝 First Unique Character in String
- Day 34: 🌳 Build Binary Tree
- Day 35: 🚲 Inorder Traversal in Binary Tree
- Day 36: 🚲 Postorder Traversal in Binary Tree
- Day 37: 🚲 Preorder Traversal in Binary Tree
- Day 38: 🌳 Height of Binary tree
- Day 39: 🔢 Count Nodes of Binary tree
- Day 40: 📌 Sum of Nodes of Binary tree
- Day 41: 📌 Reverse a Linked List
- Day 42: 🔗 Check Palindrome in a LinkedList
- Day 43: 🔖 Reorder Linked List
- Day 44: 🔍 Find the Duplicate number
- Day 45: 🎯 Find all Duplicates in an Array
- Day 46: 🔢 Find Smallest Positive
- Day 47: 📚 Subarray Product less than K
- Day 48: 📝 Length of longest subarray with atmost k frequency
- Day 49: 🔄 Count subarrays where max element appears atlest K times
- Day 50: 🔽 Minimum element in BST
- Day 51: 🌳 Closest Neighbour in BST
- Day 52: 📏 Length of the Last word
- Day 53: 📝 Isomorphic strings
- Day 54: 🔍 Word Search
- Day 55: 📌 Maximum Nesting Depth of the Parentheses
- Day 56: 💥 Make the String Great
- Day 57: 📝 Minimum Remove to Make Valid Parentheses
- Day 58: 🎒 Valid Parenthesis String
- Day 59: 👩🎓 Number of Students Unable to Eat Lunch
- Day 60: 🍿 Time to buy tickets
- Day 61: 🃏 Reveal Cards In Increasing Order
- Day 62: 📌 Find Pivot Index
- Day 63: 💧 Trapping Rain Water ...and many more to come!
- Day 64: 📝 Product of Array Except Self
- Day 65: 🌳 Sum of Left Leaves
- Day 66: 🌳 Sum Root to Leaf Numbers
- Day 67: 🌳 Add One Row to Tree
- Day 68: 🌳 Smallest string Starting From Leaf
- Day 69: 🏝️ Island Perimeter
- Day 70: 🏝️ Number of Islands
- Day 71: 📝 Find Union of two sorted arrays
- Day 72: 💥 Symmetric trees
- Day 73: 🔄 Minimum Depth of Binary Tree
- Day 74: 🔢 Create Graph
- Day 75: 📌 nth Tribonacci number
- Day 76: 🎯 BFS(Breath First Search)
- Day 77: 🎯 DFS(Depth First Search)
- Day 78: 🔄 Has Path?
- Day 79: 🎒 Maximum Prime Difference
- Day 80: 📝 Reverse Vowels of String
- Day 81: 📝 Climbing stairs
- Day 82: 💥 Reverse prefix of word
- Day 83: 🔄 Largest positive integer that exists with its Negative
- Day 84: 🔢 Compare version number
- Day 85: 📌 Boats to save people
- Day 86: 🎯 Determine if two strings are close
- Day 87: 🎯 Maximum average subarray
- Day 88: 🔄 Double a number represented as a linked list
- Day 89: 🎒 Relative ranks
- Day 90: 📝 Maximize Happiness of Selected Children
- Day 91: 💥 K th smallest prime fraction
- Day 92: 📝 Minimum cost to hire k workers
- Day 93: 🎒 Largest local values in a matrix
- Day 94: 👩🎓 Add two numbers
- Day 95: 🍿 Path with maximum gold
- Day 96: 🃏 Wildcard matching
- Day 97: 📌 Evaluate boolean binary tree
- Day 98: 💧 Delete leaves with a given value
- Day 99: 📝 Distribute coins in binary tree
- Day 100: 🌳 Jump game
Each day, a new folder will be added to this repository containing:
- A README.md file explaining the day's problem statement, including examples and constraints.
- A Solution.java file with the solution code.
- An Input.txt file with sample inputs.
- An Output.txt file with expected outputs.
Feel free to clone this repository, explore the solutions, and even contribute by suggesting alternative solutions or improvements!
git clone https://github.com/officialRanjanaDevi/Java_With_DSA-.gitContributions are what make the open-source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/AmazingFeature) - Commit your Changes (
git commit -m 'Add some AmazingFeature') - Push to the Branch (
git push origin feature/AmazingFeature) - Open a Pull Request
Distributed under the MIT License. See LICENSE for more information.
Let's dive deep into the world of Java and DSA, one day at a time! Happy coding! 💻