Rohit Gawanderohit253.hashnode.dev·Nov 9, 2024Chapter 47 -Segment Trees: The Final Chapter of My DSA JourneyHey everyone! 🎉 I’m thrilled to share that this is the last chapter in my DSA with Java series! It’s been an incredible journey, and I’m excited to wrap it up with an important topic: Segment Trees. Segment trees are a powerful data structure, used ...Discusssoftware development

Rohit Gawanderohit253.hashnode.dev·Nov 9, 2024Chapter 46: Dynamic Programming (Part 6) - DSA SeriesWelcome to Chapter 46 of my Data Structures and Algorithms (DSA) Series! In this chapter, we dive into essential dynamic programming concepts focused on matrix operations and complex problem-solving techniques. Dynamic programming is all about breaki...Discusstabulation

Rohit Gawanderohit253.hashnode.dev·Nov 9, 2024Title: Chapter 45: Dynamic Programming (Part 5) – Wildcard Matching, Catalan's Number, Counting BSTs, and Mountain RangesIntroduction Welcome to Part 5 of the Dynamic Programming series! In this chapter, we'll tackle challenging problems that involve pattern matching, combinatorics, and counting structures. Topics include: Wildcard Matching (explanation and code) Cat...DiscussDSA(Data Structure and Algorithm) In JAVAcatalan

Nachiketcodewithnachiket.hashnode.dev·Nov 3, 2024Mastering Java Strings: String Pool, Immutability, and the Power of StringBuilderIntroduction Welcome to another deep dive into essential Java concepts! This time, we'll uncover the inner workings of Strings in Java—how they are stored, what makes them efficient, and the game-changing role of StringBuilder. Understanding these fu...Discuss·10 likesJava

Rohit Gawanderohit253.hashnode.dev·Oct 26, 2024Chapter 35: Dynamic Programming Part 3 - Advanced Problems and TechniquesDynamic Programming (DP) helps solve complex problems by breaking them into manageable subproblems, saving time by reusing solutions. In this chapter, we explore advanced DP problems that frequently appear in competitive programming and real-life app...DiscussDSA(Data Structure and Algorithm) In JAVADeveloper

Rohit Gawanderohit253.hashnode.dev·Oct 25, 2024Chapter 41: Dynamic Programming (Part 2)Introduction In this chapter, we dive deeper into Dynamic Programming, focusing on several classic problems and strategies associated with Knapsack-type problems. These problems, widely known for their use of recursion, memoization, and tabulation, h...DiscussDSA(Data Structure and Algorithm) In JAVADSA

Nachiketcodewithnachiket.hashnode.dev·Oct 25, 2024Sorting Simplified: Bubble, Selection, Insertion, and Cycle Sort ExplainedSorting is one of the most critical operations in DSA, forming the foundation of many complex algorithms. I explored various sorting algorithms like Bubble Sort, Selection Sort, Insertion Sort, and Cycle Sort. Each of these algorithms offers differen...Discuss·10 likes·33 readsDSA

Vaishnavi Dwivedivaishd.hashnode.dev·Oct 23, 2024Chapter 3 : Time and Space ComplexityDijkstra’s Algorithm, Sieve of Eratosthenes, Bellman-Ford Algorithm, Kruskal’s Algorithm, Floyd-Warshall Algorithm, and many more—do you know why these fancy names exist? Or, rather, why does DSA exist at all? Of course, we need different data struct...Discuss·1 likeLearn DSA - JAVABig Omega

Reuben D'souzareubendsouza.hashnode.dev·Oct 22, 2024Binary Search - IBinary search is a searching algorithm that is used on a sorted array by repeatedly dividing the search interval by half. The search space is reduced by comparing the target element with the middle element of the search space. Complexity Analysis Be...DiscussDSA

Rohit Gawanderohit253.hashnode.dev·Oct 16, 2024Chapter 40: Dynamic Programming (Part 1)Introduction to Chapter : Dynamic Programming (DP) is a powerful technique for solving problems that involve overlapping subproblems and optimal substructure. It allows us to optimize recursive solutions by storing results of subproblems, preventing ...Discuss·32 readsDSA(Data Structure and Algorithm) In JAVADynamic Programming