Minimum Dice Throws with BFS Algorithm in Java

LeetCode Daily — Problem #3794: Reverse String Prefix Today’s challenge was a fun string manipulation task: Problem: Given a string s and an integer k, reverse the first k characters and return the resulting string. Example: Input: s = "abcd", k = 2 Output: "bacd" Approach: I converted the string to a character array, reversed the first k characters using a loop, and then appended the rest. Here's the Java solution:✅ Result: Accepted with 0 ms runtime! Takeaway: This problem reinforced how simple logic and clean iteration can solve string-based challenges efficiently. It’s a great reminder that even “Easy” problems can sharpen your fundamentals. #LeetCode #Java #StringManipulation #CodingChallenge #100DaysOfCode #ProblemSolving #LinkedInLearning

Day26 - LeetCode Journey Solved LeetCode 345: Reverse Vowels of a String in Java ✅ This problem was a fun twist on the classic string reversal pattern. Instead of reversing the whole string, the focus was only on vowels, which makes you think a little more carefully about pointer movement and conditions. Using the two-pointer approach here felt really clean. One pointer moves from the start, the other from the end, and both skip non-vowel characters until a valid swap is possible. Simple logic, but very effective. It’s a great example of how a small condition change can turn an easy problem into a nice logical exercise. What I enjoyed most was how this problem strengthens selective traversal. You’re not touching every character blindly, you’re filtering and acting only when needed. That mindset is very useful in optimizing solutions. Key takeaways: • Strong practice of the two-pointer technique • Efficient handling of character filtering • Clean in-place swapping logic • Better understanding of conditional traversal ✅ Solution accepted successfully ✅ Solid performance with clean and readable code Problems like this make string manipulation feel more intuitive and structured. One more step forward in sharpening fundamentals 💪 #LeetCode #DSA #Java #Strings #TwoPointers #ProblemSolving #Algorithms #CodingJourney #InterviewPreparation #Consistency #DailyPractice

💡 𝗝𝗮𝘃𝗮/𝐒𝐩𝐫𝐢𝐧𝐠 𝐁𝐨𝐨𝐭 𝐏𝐞𝐫𝐟𝐨𝐫𝐦𝐚𝐧𝐜𝐞 𝐓𝐢𝐩 🔥 💎 𝗣𝗿𝗲𝗳𝗲𝗿 𝗦𝘁𝗿𝗶𝗻𝗴𝗕𝘂𝗶𝗹𝗱𝗲𝗿 𝗢𝘃𝗲𝗿 𝗦𝘁𝗿𝗶𝗻𝗴 𝗖𝗼𝗻𝗰𝗮𝘁𝗲𝗻𝗮𝘁𝗶𝗼𝗻 𝗶𝗻 𝗟𝗼𝗼𝗽𝘀 🐌 𝗧𝗵𝗲 𝗣𝗿𝗼𝗯𝗹𝗲𝗺 𝘄𝗶𝘁𝗵 𝗦𝘁𝗿𝗶𝗻𝗴 𝗖𝗼𝗻𝗰𝗮𝘁𝗲𝗻𝗮𝘁𝗶𝗼𝗻  Strings are immutable in Java, so the '+' operator creates a new String object with every concatenation. In loops, this creates thousands of temporary objects that need to be garbage collected. This dramatically impacts both performance and memory usage. 🔥 𝗪𝗵𝘆 𝗦𝘁𝗿𝗶𝗻𝗴𝗕𝘂𝗶𝗹𝗱𝗲𝗿 𝗶𝘀 𝗕𝗲𝘁𝘁𝗲𝗿 StringBuilder uses a mutable character buffer and modifies it in place without creating new objects. In benchmarks with 10,000 iterations, StringBuilder completes in ~4ms while '+' operator takes ~400ms. That's 100x faster with significantly lower memory allocation. ✅ 𝗪𝗵𝗲𝗻 𝘁𝗼 𝗨𝘀𝗲 𝗘𝗮𝗰𝗵 ◾ Use StringBuilder for loops and multiple concatenations. ◾ Use '+' for simple, single-line string building (2-3 strings). ◾ The compiler optimizes simple '+' usage, but not in loops. #java #springboot #programming #softwareengineering #softwaredevelopment

Struggling with LeetCode 721 – Accounts Merge? It’s one of those problems that looks simple but hides a classic graph / Union-Find pattern interviewers love. I just published a step-by-step tutorial that walks you through: • the right mindset for connected components • a dry run with visualization • clear input → output examples • both Java and Python implementations • time & space complexity explanation If you want to master how to turn real-world merging logic into clean code, this guide is for you. 👉 Read here: https://lnkd.in/geyPMw8H Let me know if you want a DFS variant or a whiteboard explanation script! #LeetCode #CodingInterview #Java #UnionFind #DSA #Algorithms #SoftwareEngineering #TechLearning

LeetCode Practice - 1047. Remove All Adjacent Duplicates In String ✅ Key idea Instead of using a real stack: 🔷We use a character array 🔷And an integer pointer (top) 🔷This behaves exactly like a stack. 🧩 What we maintain 🔷char[] stack → stores final characters 🔷top → points to the last inserted character 🔷top = -1 → stack is empty #LeetCode #Java #StringHandling #CodingPractice #ProblemSolving #DSA #DeveloperJourney #TechLearning

🌙Shallow Copy (clone / Arrays.copyOf) of an array ☐☐☐ Outer array becomes new ✅ Inner arrays are still SAME references ❌ So if you change inside value → both change. ✅ original and shallow point to different outer arrays (different addresses) ❌ but original[i] and shallow[i] point to the same inner row arrays (same addresses) In one line:✅ “Two variables point to different outer arrays, but the rows inside are pointing to the same memory.” ✅ in shallow copy, outer array is new, but the rows are shared, so changing a cell changes both. ❌If you assign a new 1D row to the copied 2D array, only that row becomes different in the copy; the other rows still stay shared with original. A 2D array in Java is actually: ✅ “array of references to 1D arrays” So when you clone the outer array, Java copies: the list of references (outer) not the actual row arrays (inner) Cell change: shallow[0][0] = 5 ➡️ You edited the same shared row → both see it ✅ Row replacement: shallow[0] = new int[]{...} ➡️ You changed only which row reference shallow points to → original remains same ✅ ✅ toString() prints only the memory address of inner arrays (useless). ✅ Arrays.deepToString() prints the actual values inside all rows (proper output). GitHub Link: https://lnkd.in/g2j8X_-z 🔖Frontlines EduTech (FLM) #Java #Arrays #DeepCopy #2DArray #JavaProgramming #Coding #DSA #ProgrammingBasics #LearnJava #CodeSnippet

LeetCode Practice - 844. Backspace String Compare 🔷Given two strings s and t, return true if they are equal when both are typed into empty text editors. '#' means a backspace character. 🔷Note that after backspacing an empty text, the text will continue empty.   Example 1: Input: s = "ab#c", t = "ad#c" Output: true Explanation: Both s and t become "ac". Example 2: Input: s = "ab##", t = "c#d#" Output: true Explanation: Both s and t become "". Example 3: Input: s = "a#c", t = "b" Output: false Explanation: s becomes "c" while t becomes "b".   Constraints: 1 <= s.length, t.length <= 200 s and t only contain lowercase letters and '#' characters. #LeetCode #Java #StringHandling #CodingPractice #ProblemSolving #DSA #DeveloperJourney #TechLearning

Day24 - LeetCode Journey Solved LeetCode 38: Count and Say in Java ✅ This problem was a really interesting mix of pattern recognition and string manipulation. At first, the sequence looks confusing, but once you understand that each term is built by “reading” the previous one, everything starts to make sense. It’s basically about observing, grouping similar characters, counting them, and building the next string step by step. Implementing this felt like practicing clean iteration and careful string construction. Using a StringBuilder made the solution efficient and readable, and handling each group of repeating characters helped strengthen my understanding of run-length encoding style problems. What I liked most about this problem is how it trains you to think in terms of transformation. You’re not just solving for one input, you’re building a process that generates an entire sequence logically. Key takeaways: • Better understanding of pattern-based sequence generation • Clear use of loops and character grouping • Efficient string handling with StringBuilder • Improved confidence in medium-level string problems ✅ Solution accepted successfully ✅ Another solid step forward in mastering string manipulation These kinds of problems quietly sharpen logic and attention to detail. Staying consistent and enjoying the learning curve 💪 #LeetCode #DSA #Java #Strings #ProblemSolving #Algorithms #CodingJourney #InterviewPreparation #Consistency #DailyPractice

𝐇𝐨𝐰 𝐭𝐨 𝐑𝐞𝐚𝐝 𝐚𝐧𝐝 𝐏𝐫𝐢𝐧𝐭 𝐚𝐧 𝐈𝐧𝐭𝐞𝐠𝐞𝐫 𝐕𝐚𝐥𝐮𝐞 𝐢𝐧 𝐉𝐚𝐯𝐚 𝐔𝐬𝐢𝐧𝐠 𝐒𝐜𝐚𝐧𝐧𝐞𝐫 𝐂𝐥𝐚𝐬𝐬 The Scanner class in java.util package is the easiest way to take input from the user in Java. It reads data from various input sources, including the keyboard. 𝐈𝐦𝐩𝐨𝐫𝐭 𝐃𝐞𝐜𝐥𝐚𝐫𝐚𝐭𝐢𝐨𝐧: 𝘪𝘮𝘱𝘰𝘳𝘵 𝘫𝘢𝘷𝘢.𝘶𝘵𝘪𝘭.𝘚𝘤𝘢𝘯𝘯𝘦𝘳 𝐒𝐭𝐞𝐩𝐬 𝐭𝐨 𝐑𝐞𝐚𝐝 𝐚𝐧𝐝 𝐏𝐫𝐢𝐧𝐭 𝐚𝐧 𝐈𝐧𝐭𝐞𝐠𝐞𝐫 𝐮𝐬𝐢𝐧𝐠 𝐚 𝐒𝐜𝐚𝐧𝐧𝐞𝐫 ➟ Import the Scanner class. ➟ Create a Scanner object to read input. ➟ Prompt the user for input. ➟ Read the integer using nextInt(). ➟ Print the integer using System.out.println(). ▓▒░▓▒░▓▒░▓▒░▓▒░▓▒░▓▒░ 𝐄𝐱𝐚𝐦𝐩𝐥𝐞: 𝘪𝘮𝘱𝘰𝘳𝘵 𝘫𝘢𝘷𝘢.𝘶𝘵𝘪𝘭.𝘚𝘤𝘢𝘯𝘯𝘦𝘳; 𝘱𝘶𝘣𝘭𝘪𝘤 𝘤𝘭𝘢𝘴𝘴 𝘎𝘍𝘎{  𝘱𝘶𝘣𝘭𝘪𝘤 𝘴𝘵𝘢𝘵𝘪𝘤 𝘷𝘰𝘪𝘥 𝘮𝘢𝘪𝘯(𝘚𝘵𝘳𝘪𝘯𝘨[] 𝘢𝘳𝘨𝘴){   // 𝘚𝘵𝘦𝘱 1: 𝘊𝘳𝘦𝘢𝘵𝘦 𝘚𝘤𝘢𝘯𝘯𝘦𝘳 𝘰𝘣𝘫𝘦𝘤𝘵   𝘚𝘤𝘢𝘯𝘯𝘦𝘳 𝘴𝘤 = 𝘯𝘦𝘸 𝘚𝘤𝘢𝘯𝘯𝘦𝘳(𝘚𝘺𝘴𝘵𝘦𝘮.𝘪𝘯);   // 𝘚𝘵𝘦𝘱 2: 𝘗𝘳𝘰𝘮𝘱𝘵 𝘶𝘴𝘦𝘳 𝘧𝘰𝘳 𝘪𝘯𝘱𝘶𝘵   𝘚𝘺𝘴𝘵𝘦𝘮.𝘰𝘶𝘵.𝘱𝘳𝘪𝘯𝘵("𝘌𝘯𝘵𝘦𝘳 𝘢𝘯 𝘪𝘯𝘵𝘦𝘨𝘦𝘳: ");   // 𝘚𝘵𝘦𝘱 3: 𝘙𝘦𝘢𝘥 𝘪𝘯𝘵𝘦𝘨𝘦𝘳 𝘪𝘯𝘱𝘶𝘵   𝘪𝘯𝘵 𝘯𝘶𝘮𝘣𝘦𝘳 = 𝘴𝘤.𝘯𝘦𝘹𝘵𝘐𝘯𝘵();   // 𝘚𝘵𝘦𝘱 4: 𝘗𝘳𝘪𝘯𝘵 𝘵𝘩𝘦 𝘦𝘯𝘵𝘦𝘳𝘦𝘥 𝘪𝘯𝘵𝘦𝘨𝘦𝘳   𝘚𝘺𝘴𝘵𝘦𝘮.𝘰𝘶𝘵.𝘱𝘳𝘪𝘯𝘵𝘭𝘯("𝘠𝘰𝘶 𝘦𝘯𝘵𝘦𝘳𝘦𝘥: " + 𝘯𝘶𝘮𝘣𝘦𝘳);   // 𝘊𝘭𝘰𝘴𝘦 𝘵𝘩𝘦 𝘴𝘤𝘢𝘯𝘯𝘦𝘳   𝘴𝘤.𝘤𝘭𝘰𝘴𝘦();  } } ▓▒░▓▒░▓▒░▓▒░▓▒░▓▒░▓▒░▓▒░ 𝐎𝐮𝐭𝐩𝐮𝐭: Enter an integer: 123 You entered: 123 ...Program finished with exit code 0 Press ENTER to exit console. 𝐄𝐱𝐩𝐥𝐚𝐧𝐚𝐭𝐢𝐨𝐧: ➟ Scanner sc = new Scanner(System.in); -> Creates a Scanner object to take input. ➟ nextInt() -> Reads an integer value entered by the user. ➟ System.out.println() -> Prints the entered integer on the screen. #Java #PrintanInteger #ScannerClass #String #JAVAEXPLANATIONS #JAVAExamples #Coding #Developer #CodeLife #Programmer #AshokIT

Day25 - LeetCode Journey Solved LeetCode 344: Reverse String in Java ✅ This was a simple problem on the surface, but it perfectly highlights how powerful clean logic can be. The goal was to reverse a string in-place using O(1) extra space, which means no extra arrays and no shortcuts. Just pure two-pointer logic. Using the left and right pointers and swapping characters step by step felt very satisfying. It’s one of those patterns that looks small but appears everywhere in interviews and real-world problems. Mastering this makes many string and array problems much easier later on. What I liked about this problem is how it teaches efficiency. Instead of creating new memory, we directly modify the existing array. That mindset of optimizing space is extremely important in DSA. Key takeaways: • Strong practice of the two-pointer technique • In-place operations with constant extra space • Clean and readable swapping logic • Reinforced fundamentals of string manipulation ✅ Accepted successfully ✅ 0 ms runtime with optimal performance Sometimes the simplest problems build the strongest foundations. Consistency with basics is what makes complex problems feel easier later 💪 #LeetCode #DSA #Java #Strings #ProblemSolving #Algorithms #CodingJourney #InterviewPreparation #TwoPointers #Consistency #DailyPractice