Recreate Classic Snake Game in Java with Logic and Rendering

📝 Day 12/30 – LeetCode #344 (Reverse String) | Java Although reversing a string seems simple, the constraint here is to do it in-place without using extra memory. Using built-in functions would defeat the purpose of the problem. By applying a two-pointer approach, I swapped characters from both ends of the array until they met in the middle. This resulted in a clean O(n) solution with O(1) space. This problem reinforced how even simple tasks can test understanding of constraints and memory efficiency. #LeetCode #Java #DSA #TwoPointers #Strings #Consistency #LearningInPublic

Day 8/30 – LeetCode #14 (Longest Common Prefix) | Java The challenge here wasn’t complexity, but handling edge cases cleanly. My initial thought was to compare characters column by column, but managing bounds made the logic harder to read. Using the first string as a reference prefix and gradually shrinking it with substring() until it matched all other strings simplified the solution. The startsWith() check kept the code readable while maintaining correctness. This problem reinforced how clarity in string manipulation often matters more than clever logic. #LeetCode #Java #DSA #Strings #ProblemSolving #Consistency #LearningInPublic

Day 14/30 – LeetCode #3 (Longest Substring Without Repeating Characters) | Java A brute-force approach would check all possible substrings, which quickly becomes inefficient. The challenge here was maintaining a substring with unique characters while scanning the string only once. Using a sliding window with a HashSet, I expanded the window when characters were unique and shrank it whenever a duplicate appeared. This ensured each character was processed at most twice, resulting in an O(n) solution. This problem clearly demonstrated how sliding window techniques help manage dynamic constraints efficiently. #LeetCode #Java #DSA #SlidingWindow #HashSet #Strings #Consistency #LearningInPublic

Sometimes it’s useful to build something visual to remind ourselves what Java is still very good at. This article walks through a Quarkus REST service that accepts an image upload and returns a jigsaw puzzle version of it. Along the way: multipart handling, Java 2D, vector math, and a clean separation between geometry and rendering. No frontend framework. No shortcuts. Just a practical Java service doing real work. https://lnkd.in/da7uSvct #Java #Quarkus #EnterpriseSoftware

Loops running forever? Code executing when it shouldn’t? 😬 Meet jump statements. Part 3: Jump Statements (break, continue, return). Learn how to stop, skip, or exit — the right way. Clean flow → Clean code ✨. 👉 Follow for more Java fundamentals. 🔁 Save & repost to revise the full Control Statements series. . . Thanks to Harshita Mittal for the design touch! . . #Java #CoreJava #JavaProgramming #JavaBasics #ControlStatements #JumpStatements #Break #Continue #Return #LearnJava #ProgrammingConcepts #Coding #CodeNewbie #BeginnerFriendly #SoftwareEngineering #DeveloperJourney #JavaSeries #LinkedInLearning #LogicBuilding #CleanCode

DSA journey 🚀 📌 LeetCode #1464 – Maximum Product of Two Elements in an Array 💻 Language: Java 🔹 Approach: Traverse the array once to find the largest and second largest elements Update both values in a single loop Apply the formula: (max − 1) × (secondMax − 1) ⏱ Time Complexity: O(n) 🧩 Space Complexity: O(1) Small optimizations, big wins 💡 Consistency over perfection 💯 #DSA #Java #LeetCode #ProblemSolving #LearningInPublic #DSAWithedSlash 🚀

🚀 LeetCode Problem Solved: Two Sum II (Input Array is Sorted) Implemented an optimized solution in Java using the Two Pointer technique. Since the array is already sorted, we can efficiently adjust pointers based on the current sum and find the required pair without using extra space. ✅ Time Complexity: O(n) ✅ Space Complexity: O(1) Source Code : https://lnkd.in/ew2_GMw9 This problem is a great example of how understanding constraints (sorted input) helps in designing efficient solutions. #LeetCode #Java #DSA #TwoPointers #ProblemSolving #CodingJourney

Day: 32/365 📌 LeetCode POTD: Minimum Deletions to make string balanced Medium Key takeaways/Learnings from this problem: 1. Using a stack makes the imbalance obvious—you directly see where a b is messing up the order before an a. 2. Big takeaway: sometimes simulating the process cleanly is easier than mathy DP, and still gives an optimal result. #POTD #365DaysOfCode #DSA #Java #ProblemSolving #LearningInPublic #Consistency 🥷