Java 17 Pattern Matching Simplifies Switch Statements

Day 68 of #100DaysOfCode 🚀 Today I implemented Pascal’s Triangle using Java. At first glance, it looks like just a pattern problem. But internally, it teaches something powerful — building current state from previous state. 🔹 The first and last elements of every row are always 1 🔹 Every middle element = sum of two elements from the previous row 🔹 This is a classic example of bottom-up thinking Instead of hardcoding values, we dynamically generate each row based on the previous one. This problem strengthened: Nested loop understanding 2D List handling in Java Pattern recognition Thinking in terms of recurrence Small problems. Strong foundations. Consistent progress. On to the next one 💪 #100DaysOfCode #Java #DSA #ProblemSolving #LearningInPublic #dsawithkunal

#Day13 – Advanced Strings & Mutable vs Immutable 🤯 Today was all about Advanced String concepts and understanding Mutable vs Immutable in Java. ✔ Difference between immutable and mutable strings ✔ How concat() creates a new object in Heap ✔ How reference update changes output ✔ Difference between String, StringBuffer, and StringBuilder ✔ Initial capacity (16) and dynamic capacity formula (n * 2 + 2) ✔ Methods like length(), charAt(), toCharArray() ✔ Split vs StringTokenizer (why split is recommended) TAP Academy Harshit T #Java #Strings #StringBuilder #StringBuffer #CoreJava #ProgrammingJourney #Consistency

🚀 Day 73 / 100 Days of LeetCode Question: Check if Binary String Has at Most One Segment of Ones Given a binary string s, determine whether it contains at most one continuous segment of '1's. Solved in Java by checking whether the pattern "01" exists in the string. If "01" appears, it means a new segment of 1s starts after a 0, which violates the condition. This provides a clean and efficient solution. Consistency > perfection. Day 74 loading 🔥 #100DaysOfCode #LeetCode #Java #DSA #ProblemSolving

✅ DSA Day 8 / 100 Solved Reverse an Array on HackerRank using Java. Problem: Given an array, return the array in reverse order. Logic : - Use the built-in method Collections.reverse() -This method reverses the elements of the list directly -Then return the reversed list This problem helped me understand how arrays/lists can be manipulated easily using Java utility methods. #DSA #100DaysOfCode #Java #HackerRank #LearningInPublic #BeginnerDSA

🚀 Day 24/180 | #180DaysOfCode 📍 LeetCode | 💻 Java Solved: 2859. Sum of Values at Indices With K Set Bits Used bit manipulation to count the number of set bits in each index and summed the values whose index contains exactly k set bits. ⏱️ Time Complexity: O(n log n) 📦 Space Complexity: O(1) Strengthening understanding of bitwise operations and binary representation through consistent practice. 💪 Consistency continues 🚀 #DSA #LeetCode #Java #CodingJourney #Consistency

Leetcode Problem || Complement of Base 10 Integer(1009) 🚀 The Bitwise Complement problem using Java. 🔹 Idea: The complement of a number means flipping all bits in its binary representation (0 → 1 and 1 → 0). Instead of manually converting the number to binary, I used a bit manipulation trick: 1️⃣ Find the highest set bit using Integer.highestOneBit(n) 2️⃣ Create a mask with all bits set to 1 up to that position 3️⃣ Use XOR (^) with the mask to flip the bits #LeetCode #Java #BitManipulation #CodingPractice #ProblemSolving #SoftwareDevelopment

A stream in java is a sequence of objects, its just a way to get data out of a collection. Collection interface in java has the stream method so all collections support stream. Arrays dont have a stream method we can make a stream out of an array by using Arrays util class's stream static method. Stream is used to process data from a collection in a declarative way much like we do chaining of array methods in JS/TS. We can have finite or infinite streams. #Java #Backend #SoftwareEngineering

Day 3/50 | #50DaysOfCode 📍 Platform: LeetCode 💻 Language: Java ✅ 2520. Count the Digits That Divide a Number (Easy) Today’s problem focused on digit extraction and divisibility checks. It helped strengthen my understanding of number manipulation and conditional logic. 🔎 Approach: Extract each digit using modulus (%) Check if the digit divides the original number using modulo If divisible, increment the counter Continue until all digits are processed Return the final count 📌 Example: Input: num = 1248 Output: 4 Explanation: All digits (1, 2, 4, 8) divide 1248 evenly This problem improved my understanding of loops, digit handling, and divisibility logic in Java. #DSA #LeetCode #Java #CodingJourney #ProblemSolving #Consistency #LearningJourney #50DaysOfCode #LinkedIn

🚀Java practice - Day 87 Completed! 👍 Problem: Sum of Squares of Special Elements Language: Java Today’s problem was about identifying special elements in a 1-indexed array. An element is considered special if its index divides the length of the array (n % i == 0). The task was to calculate the sum of the squares of such elements.✨ #Day87 #Java #LeetCode #Arrays #ProblemSolving #DailyCoding #Consistency #100DaysOfCode

✅ DSA Day 7 / 100 Solved Median of Two Sorted Arrays on LeetCode using Java. Logic : - Combine both sorted arrays into one array -Sort the merged array - Find the middle index - If the total length is odd → median is the middle element -If even → median is the average of the two middle elements #DSA #100DaysOfCode #Java #LeetCode #BeginnerDSA #LearningInPublic #Consistency