Cracking Counting Valleys Problem in Java

🔥 Title Solved "Library Fine" Problem Using Java 📚💻 📄 Description I recently worked on the Library Fine problem, a great exercise to strengthen conditional logic and real-world problem-solving. 🔍 Problem Summary: Calculate the fine for returning a library book late based on: Days late Months late Years late 💡 Approach: Compare return date with due date Apply fine rules based on hierarchy (year → month → day) Ensure minimum penalty logic is followed ✨ Key Learning: Breaking down conditions step-by-step helps avoid logical errors and improves clarity in coding. ⚡ Implemented in Java with simple and efficient conditional checks. 🏷️ Tags #Java #DSA #Coding #ProblemSolving #HackerRank

Today I worked on a problem that involved finding the maximum count of positive and negative numbers in a sorted array. Key idea: Used Binary Search to efficiently find: The first positive number The first non-negative number From this, we can calculate: Count of positive numbers Count of negative numbers Why Binary Search? Because the array is sorted, it helps reduce time complexity to O(log n) instead of scanning the entire array. What I learned: How to apply binary search beyond just finding elements How to think in terms of boundaries (first occurrence logic) Writing clean and optimized Java code 📌 Problem-solving is not just about coding, it's about thinking efficiently. Looking forward to learning more and improving every day! #Java #DSA #BinarySearch #CodingJourney #ProblemSolving #LearningEveryday

Exploring one of the most powerful concepts in Java — Polymorphism, and I achieved it using Inheritance with a simple Plane program. In Java, polymorphism allows a single object to take multiple forms. Using inheritance and method overriding, I implemented a Plane example where different types of planes (like Cargo Plane and Passenger Plane) show different behaviors even though they share a common parent class. It was really interesting to see how a parent class reference can call different implementations at runtime — making the program dynamic and flexible. A big thank you to TAP Academy for teaching this concept so clearly and effortlessly. The real-time examples, like the Plane program, made it much easier to understand how inheritance and polymorphism work together. Excited to apply these concepts in real-world projects and keep growing 🚀 #Java #OOP #Polymorphism #Inheritance #CodingJourney #Learning #SoftwareDevelopment #TAPAcademy

🚀 Day 75 — LeetCode Practice 🚀 Today’s problem: To Lower Case 💡 What I learned today: • Understood how to convert characters using built-in string methods • Learned the importance of string immutability in Java • Practiced writing clean and minimal code • Realized that sometimes the simplest problems reinforce core concepts 🧠 Key Idea: Use Java’s inbuilt function: toLowerCase() → converts all uppercase letters to lowercase easily 🔥 Takeaway: Not every problem needs complex logic — knowing the right method saves time ⏱️ Consistency > Complexity 💯 #Day75 #LeetCode #Java #DSA #CodingJourney #Consistency #Learning

Continuing my Java learning journey, I’ve recently explored some important concepts that are widely used in real-world applications and everyday coding. Here are the topics I covered: Strings and their immutability, along with commonly used methods LocalDate for handling dates in a clean and modern way using the Java Time API Wrapper Classes and how they bridge primitive types with objects Generics for writing type-safe and reusable code These concepts gave me a clearer understanding of how Java handles data, improves type safety, and simplifies common programming tasks. Gradually building a strong foundation to write cleaner, more efficient, and scalable Java applications. #Java #Programming #Generics #LearningJourney #SoftwareDevelopment #CDAC

Today I explored some fundamental yet powerful concepts in Java that every developer should have a strong grip on: 🔹 Static Methods & VariablesUnderstanding how static members are shared across all objects really changed how I think about memory and efficiency. It’s amazing how a simple static keyword can help track object creation and maintain shared data seamlessly. 🔹 Constructor Overloading & this KeywordThis concept made object initialization much more flexible. Using multiple constructors and the this keyword not only improves code readability but also avoids redundancy. 💡 What I realized:Strong basics are the real game-changer. These concepts might look simple, but they build the foundation for writing clean, scalable, and efficient code. 📌 Consistency in learning > Complexity in topics I’m currently focusing on strengthening my core Java skills and building projects around them. Every small concept learned today contributes to becoming a better developer tomorrow. #Java #Programming #CodingJourney #DeveloperLife #JavaDeveloper #Learning #TechSkills #Coding #StudentDeveloper

Day 7/50 - Wild Coding Kickoff Today's challenge was all about counting frequency of elements using a clean and efficient approach in Java. ⚡️Instead of writing complex logic, I used a Hash Map + getorDefault() make the solution simple 🥶Problem: Count how many times each element appearsin an array Input [ 1,2,2,3.1.4] Output 1->2 2->2 3->1 4->1 🔥Key Learning: Using getorDefault ( ) helps avoid unnecessary condition checks and keeps the code clean and readable #Learning #CareerGrowth #DSA #SkillDevelopment #TechCareers #DeveloperJourney #ContinuousLearning

🚀 Mastering Java Through LeetCode 🧠 Day 17 of My DSA Journey Today I solved another problem from the LeetCode list to improve my understanding of arrays and prefix sum concepts. 📌 LeetCode Problem Solved Today: Q.1732. Find the Highest Altitude In this problem, a biker starts a road trip from altitude 0, and we are given an array that represents the gain or loss in altitude between points. The task is to find the highest altitude reached during the trip. Method 1: Using ArrayList (My 1st Approach) I stored all altitudes step by step in an ArrayList and then used Collections.max() to find the highest altitude. Method 2: Optimized Approach (My Second Approach Without Extra Space) Instead of storing all values, we can directly track the maximum altitude while iterating. 💻 Optimized Java Solution class Solution { public int largestAltitude(int[] gain) { int altitude = 0; int maxAltitude = 0; for (int g : gain) { altitude += g; maxAltitude = Math.max(maxAltitude, altitude); } return maxAltitude; } } Example: Input: gain = [-5,1,5,0,-7] Altitudes formed: [0, -5, -4, 1, 1, -6] Highest altitude = 1 Consistent practice is helping me strengthen my DSA and problem-solving skills step by step. #LeetCode #DSA #Java #CodingJourney #ProblemSolving #ArrayList #100DaysOfCode #SPPU #EngineeringLife #TechCommunity #CDAC

Not everything valuable comes with a headline. In the Weekly Java Challenge #3, the certificate says “participation” — but the leaderboard says something more. 🌟 Rank 8 | Score: 20 Somewhere between debugging logic and racing against time, I found growth — sharper thinking, cleaner problem-solving, and a better understanding of how to approach challenges under pressure. No shortcuts, just consistency. This isn’t a finish line — it’s momentum 🚀 #Java #CodingChallenge #ProblemSolving #GrowthMindset #Consistency #KeepBuilding

Day 31 of #50DaysLeetCode Challenge 💻🔥 Today I solved the “Permutations” problem using Java. 🔹 Problem: Given an array of distinct integers, return all possible permutations. 🔹 Reality check: If you don’t understand recursion properly, this problem will expose you. There’s no shortcut here. 🔹 Approach (Backtracking): Fix one element at a time Swap it with every possible choice Recurse for the remaining positions Backtrack (undo the swap) to explore other possibilities 🔹 Key Insight: This isn’t about generating values — it’s about exploring a decision tree. Every level = a position in the array Every branch = a choice 🔹 Time Complexity: O(n!) — and that’s unavoidable 📌 What I learned: Backtracking is not optional for DSA. If you try to avoid it, you’ll get stuck on a whole category of problems. Stop memorizing patterns blindly. Understand why the recursion works. #Day25 #LeetCode #Java #Backtracking #DSA #CodingChallenge #ProblemSolving