Day1️⃣9️⃣:IDE debugger appreciation post🐞 Use debugger inside the IDE turns debugging into a structured process instead of guesswork.Setting breakpoints,stepping through lines,and watching variables change in real time makes it so much easier to understand control flow. #Java @X

Day1⃣8⃣: Till I get a job. LC 2110 – No. of Smooth Descent Periods of a Stock 📉 Used a linear search with streak count ->when today’s price is exactly 1 less than yesterday’s, extend the current descent streak; otherwise reset it to 1. #LeetCode #DSA #Java #CodingJourney @sama

Day1️⃣7️⃣:LC 2147 – No. of Ways to Divide a Long Corridor. Approach: Each valid segment must contain exactly two seats. Gather all indices of S. If the seat count is zero or odd-answer is 0.Then,between every pair of seat-groups. #LeetCode #DSA #Math #Combinatorics #Java @X @sama

Day 1⃣6⃣:Till I get a job. LC 3606: Coupon Code Validator Validated coupons by checking non‑empty alphanumeric/underscore codes,allowed business lines,and active status. #LeetCode #DSA #Java #CodingJourney #StringManipulation #Sorting @TCS @X @elonmusk @DeloitteIndia @kirat_tw

Day1️⃣5️⃣: Till I get a job. LC 103: Binary Tree Zigzag LOT Used a classic BFS with a queue to process nodes level by level, then flipped the order on every alternate level using a simple parity check . #LeetCode #DSA #BinaryTree #BFS #Java #CodingJourney @X @kirat_tw @TCS @ICC

Day1️⃣4️⃣:Till I get a job. LC 3531.Count Covered Buildings. For each row and col,tracked the min and max coordinates where a building exists.A building at(x,y) is cover if there’s at least one building left,right,above and below it.🚀@X #LeetCode #DSA #Arrays #Java #CodingJourney

Day1️⃣3️⃣ POTD: Till I get a job. LC 3577 – Count the No. of Computer Unlocking Perm. Computer 0 is already unlocked. For every other computer, its complexity must be strictly > than at least one previous computer.🚀 #LeetCode #POTD #DSA #Math #Combinatorics #Java #CodingJourney @X

Day1️⃣2️⃣:Till I get a job. Solved LC 3583 – Cnt Spl. Tpts. A triplet (i, j, k) is nums[i] = nums[j]*2 and nums[k] = nums[j]*2. Instead of O(n³) brute force, stored counts of numbers to the right, then for each value v used hash maps to track how many v are on the left and right.🚀

Day 1️⃣1️⃣: Till I get a job. Solved LC 187–Repeated DNA Sequences. A 10-length window over the string, used a HashMap to count each substring, and a Set to store those with freq > 1.(sliding window + hashing )🚀 #LeetCode #DSA #HashMap #SlidingWindow #Java #CodingJourney @X @TCS

Day1️⃣1️⃣: Till I get a job. Solved LC 1925 – Count Square Sum Triples✅ Brute-force all pairs (a, b) up to n,computed c² = a² + b², then checked if c is an integer and c ≤ n. If yes,it forms a valid square sum triple (a, b, c).🚀 @TCS @X #LeetCode #DSA #Math #Java #CodingJourney

Day 1️⃣0️⃣: Till I get a job. Solved LC 1523–Count Odd No. in an Interval Range. Used pure math instead of iteration,compute how many numbers are in [low,high],then if both low and high are odd,the count of odds is len/2+1,otherwise it’s len.🚀 #LeetCode #DSA #Math #Java #Coding

Day 8️⃣: Till I get a job. Solved LC 3432 – Count Partitions with Even Sum Diff. If the total sum of the array is even, then every partition will have an even difference between left and right sums, so the answer is n - 1 otherwise return 0. #LeetCode #DSA #Math #PrefixSum #Java

Day9️⃣: Till I get A job. LC 2211–Count Collisions on a Road. 1st attempt: tried simulating traffic with a stack,it worked on small cases but became messy and easy to miss edge patterns at the borders. Final approach (two pointers + count) #LeetCode #DSA #Java #Greedy #Algorithms

Day7️⃣: Solved 2141 – Maximum Running Time of N Computers Used binary search on the answer: guess a time t, cap each battery at t, and check if the total usable charge ≥ n * t. If yes, push t higher, else lower it. #LeetCode #DSA #BinarySearch #Java #CodingJourney @elonmusk @TCS

Day 6: Till I Get a Job. The Model layer in apps defines your core data and business logic🛠️.It contains entity classes, enforces rules, and manages how info is stored and shared across your system. With ORM tools like #JPA, real-world concepts become Java objects! #Backend @TCS

Day 5: Till I Get a Job. Essential #JPA Annotations Every Java Developer Must Know.. #Java #SpringBoot #BackendDevelopment @Entity @Id @GeneratedValue @Column @Table @Transient #CleanCode #ORM #DeveloperTips #TechIndia #100DaysOfCode @Google @kirat_tw @IndiaToday #Trending #tech

Day 4 -> Till I Get a Job. Turn Java objects into JSON (serialization) and JSON back to Java objects (deserialization) with #Jackson.🔄Effortlessly handle API data, configs, and microservices. #Java #SpringBoot #Backend #Serialization #Deserialization #100DaysOfJava #CleanCode

Interested

Day 3: Till I get A Job. Unlock database power with #JPA & #Hibernate in #Java! 🚀 .Effortless ORM, clean entity mapping, and no heavy SQL—focus on business logic, not boilerplate. Level up your #Backend for scalable, production-ready apps! #Coding #Microservices #100daysofjava

🚀Day 2: Till I Get a Job. Mastering logging in Spring Boot-keeping backend debug-friendly, scalable & secure! Use precise log levels and centralize logs for real-time insights.#Java #SpringBoot #Backend #CleanCode #Microservices #TechIndia #Hiring #100DaysOfCode @elonmusk @Meta