Java Longest Common Prefix Problem Solution

#Day17 💭 Today I came across an interview question asked in one of the product-based companies “What are the different types of thread pools in Java and how do you decide which one to use?” Before even talking about types, the first thing I understood was: 👉 What exactly is a Thread Pool? A thread pool is simply a collection of reusable threads that are created in advance and managed by Java. Instead of creating a new thread for every task (which is costly and slow), we: • Submit tasks to a pool • Available threads pick them up • After finishing, threads are reused for the next task This makes the application faster, more stable, and resource-efficient. So here’s what I understood in a simple way 👇 🔹 Fixed Thread Pool Used when we want a fixed number of threads and don’t want the system to create more. 📌 Example: Database or payment-related tasks where resource control is important. 🔹 Cached Thread Pool Creates threads when needed and reuses them. 📌 Example: Handling many short tasks or sudden traffic spikes. ⚠️ Needs careful usage for long-running tasks. 🔹 Single Thread Executor Only one thread executes tasks one by one. 📌 Example: Logging or tasks where order matters. 🔹 Scheduled Thread Pool Used for tasks that need to run after some delay or repeatedly. 📌 Example: Cleanup jobs, retry mechanisms. 🔹 Work Stealing Pool Helps in better parallel processing by sharing work between threads. 📌 Example: CPU-intensive tasks like file processing. 🧠 What I learned from this question It’s not about remembering definitions. It’s about understanding: • Nature of the task • Resource usage • Order vs parallel execution That decides the thread pool. 📌 Sharing this as part of my learning journey. Still learning, step by step. #Java #Multithreading #InterviewPreparation #BackendDevelopment #LearningInPublic #JavaDeveloper

🚀 Day 2 – Deep Dive into String Manipulation (Java) Today I worked on building a String Utility Tool to strengthen my Core Java fundamentals 💻 This mini project focused on solving real string-based problems using logic instead of shortcuts 👇 🔁 Reversed a string using StringBuilder to improve performance and avoid unnecessary object creation 🔤 Counted total vowels by iterating through each character efficiently 🔎 Identified non-repeating characters using nested loops and logical comparison Instead of just making it work, I focused on: ⚡ Writing optimized and readable code 🧠 Improving loop control and character handling 📌 Following clean method structure and naming conventions 🧹 Keeping the program modular and reusable These small exercises sharpen problem-solving skills and prepare me for real backend development challenges 🌐 Step by step. Logic by logic. Growth by growth 🚀 #Java #FullStackDeveloper #BackendJourney #DSA #SoftwareDeveloper #BuildInPublic #LearningJourney If you want, I can make Day 3 slightly more advanced so your LinkedIn progression looks powerful and intentional 🔥

Solved Two Sum II using Two-Pointer Technique (Java) Implemented an optimized solution for the Two Sum II – Input Array Is Sorted problem using the two-pointer approach in Java. By leveraging the sorted property of the array, I reduced the time complexity from O(n²) to O(n) with O(1) space complexity. 🔹 Used two pointers (start and end) 🔹 Adjusted pointers based on the sum comparison 🔹 Returned 1-based indices as required by the problem This approach demonstrates efficient problem-solving, strong understanding of array traversal, and optimization techniques commonly expected in coding interviews. #Java #DSA #TwoPointers #LeetCode #ProblemSolving #CodingInterview #Algorithms

Preparing for interviews or coding rounds? Here is a super–quick Java revision pack covering: ✔ Strings ✔ Arrays ✔ Collections (List, Set, Map) ✔ Queue, Stack, Deque ✔ PriorityQueue (Min Heap) ✔ Algorithms ✔ Graphs (BFS/DFS) ✔ Bit Manipulation This is the exact summary you need right before a technical round or coding challenge. Easy to revise, easy to remember. #Java #coding #programming #JavaDeveloper #DSA #TechInterview #LeetCode #CodingLife #SoftwareEngineering

🚀ARRAYS IN JAVA As I dive deeper into Java, I’m realizing that even the fundamentals have some hidden gems. Most of us start with the standard Array, but have you played around with Jagged Arrays? So , Hi LinkedIn 👋 Here’s the breakdown of first time experience: We usually visualize a 2D array like a spreadsheet—every row has the exact same number of columns. It’s clean, it’s structured, but it’s rigid. 💡 The Fascinating Fact: Java’s "Array of Arrays" Here is the eye-opener: In Java, a multi-dimensional array isn't a single block of memory. It is actually an array that holds other arrays. Because of this architecture, Java allows for Jagged Arrays—where every row can have a completely different length. 🤯 🛠️ how it matters?? 🤔 Memory Efficiency Real-World Logic Dynamic Thinking and more... It’s these small nuances that make Java so flexible and powerful. To my fellow developers: did you use jagged arrays in your early projects? #Java #CodingNewbie #SoftwareEngineering #DataStructures #BackendDevelopment #TechLearning 💻 See it in action 👇

🏡 Cracking the Java Interview: Your 2026 Cheat Sheet 🔥 Preparing for technical rounds can feel like trying to boil the ocean. I’ve distilled the "must-know" topics into one streamlined guide so you can focus on what matters. The Checklist: ✅ Fundamentals: Beyond the basics of OOP. ✅ Data Handling: Advanced Collections & Stream API. ✅ Performance: Multithreading, Concurrency, and JVM tuning. ✅ Problem Solving: Real-world coding scenarios and Design Patterns. Don't just memorize—understand. Build the confidence to explain why your code works, not just how. 🔥 Follow Sanjoy Rudra for daily insights into the Java ecosystem and tech career tips. #JavaDeveloper #Backend #TechInterviews #ProgrammingTips #CareerDevelopment

🚀 Day 16 of #Day365ofCoding LeetCode Today, I worked on solving the Valid Anagram problem using Java. The goal was to determine whether two strings are anagrams of each other. 🔍 Approach Used: Checked if both strings have the same length Converted strings into character arrays Sorted both arrays Compared characters one by one 📌 This approach ensures accuracy by verifying that both strings contain the same characters with the same frequency. 💡 Key Learnings: Importance of preprocessing input data How sorting simplifies comparison problems Understanding time and space complexity in real interview scenarios 📈 Time Complexity: O(n log n) 📦 Space Complexity: O(n) Consistently practicing such problems is helping me strengthen my problem-solving skills and Java fundamentals. #Java #DSA #ProblemSolving #Anagram #LeetCode #CodingPractice #LearningJourney Github link: https://lnkd.in/gGUy_MKZ

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

DSA journey 🚀 📌 LeetCode #1 – Two Sum 💻 Language: Java 🔹 Approach: Use two nested loops to check all possible pairs Compare the sum of each pair with the target Return indices once the matching pair is found ⏱ Time Complexity: O(n²) 🧩 Space Complexity: O(1) Consistency over perfection 💯 #DSA #Java #LeetCode #ProblemSolving #LearningInPublic #DSAWithedSlash

Tackling LeetCode Problem #26: Remove Duplicates from Sorted Array Today I explored the classic Two Pointers technique with this elegant Java solution. The challenge? Modify a sorted array in-place to remove duplicates and return the count of unique elements. Key Concepts: - Efficient in-place updates - Maintaining relative order - Two-pointer traversal for optimal performance 💡 Input: [1, 1, 2] ✅ Output: 2, with nums = [1, 2, _] This problem reinforces how clean logic and pointer manipulation can lead to space-efficient solutions. Perfect warm-up for interview prep and algorithmic thinking! LeetCode #Java #CodingChallenge #TwoPointers #InterviewPrep #AkashLearns #100DaysOfCode