Just Another Devjustanotherdev.hashnode.dev·7 hours agoRemaining data structuresIf the main data structures (at least based on my experience) are Lists, Arrays and Maps, the remaining important ones are: Stack and Queue Tree I covered Lists and Arrays here, and Maps here. Now let’s talk about the remaining ones. Oh, a discla...data structures
Tiger Abroditigerabrodi.blog·9 hours agoDFS and BFS explainedIntroduction In this post, I wanna dig into BFS and DFS. I wanna show some code and go through them slowly. I don't know what it is with recursion, but I'm so passionate about it. It's so beautiful when you visualize all the work. Anyways, let's star...algorithms
Reuben D'souzareubendsouza.hashnode.dev·19 hours agoStrings - IRemove outermost parenthesis Input: s = "(()())(())" Output: "()()()" Explanation: The input string is "(()())(())", with primitive decomposition "(()())" + "(())". After removing outer parentheses of each part, this is "()()" + "()" = "()()()". ...DSA
Nwosu Promise Okennaokenna.hashnode.dev·Jan 11, 2025ALGORITHMS: Implementing Selection Sort Algorithm In JavaScriptIntroduction Suppose you are organizing a deck of cards, and you want to sort it from the smallest to the largest. Naturally, you might look through the cards, find the smallest one, and place it first. Then you would look for the next smallest, and ...15 likesData Structures And AlgorithmsJavaScript
Arka Infotecharkainfotech.hashnode.dev·Jan 11, 2025Understanding Suffix Trees and Suffix ArraysIntroduction Suffix Trees and Suffix Arrays are powerful data structures designed to handle string-related problems efficiently. These structures are extensively used in applications like pattern matching, substring search, and bioinformatics, where ...10 likesSuffixArray
Arka Infotecharkainfotech.hashnode.dev·Jan 11, 2025Binary Indexed Tree (BIT): A Tool for Efficient QueriesIntroduction In the world of data structures, efficient query handling is crucial for solving a variety of computational problems. The Binary Indexed Tree (BIT), also known as the Fenwick Tree, is a powerful data structure that enables efficient hand...10 likesAlgorithmOptimization
Arka Infotecharkainfotech.hashnode.dev·Jan 11, 2025Sparse Tables: Algorithms for Range QueriesIntroduction When working with large datasets or performing repeated range queries, the need for efficient algorithms becomes paramount. One such algorithmic technique is the Sparse Table, which is designed to efficiently answer range queries in cons...10 likesRangeMinimumQuery
Arka Infotecharkainfotech.hashnode.dev·Jan 11, 2025Fenwick Tree vs Segment Tree: Which One to Use?Introduction In the world of data structures, Fenwick Trees and Segment Trees are two powerful tools used to solve range query problems efficiently. Both are designed to perform fast updates and queries on an array, but they differ significantly in t...10 likesCompetitiveProgramming
Arka Infotecharkainfotech.hashnode.dev·Jan 11, 2025Fibonacci Heaps: Advanced Heap Algorithms for OptimizationIntroduction When it comes to optimizing algorithms, particularly those involving graph-related problems or priority queues, Fibonacci Heaps offer a sophisticated approach. Named after the Fibonacci sequence, these heaps are an advanced type of heap ...10 likesPriorityQueues
Arka Infotecharkainfotech.hashnode.dev·Jan 11, 2025Two Pointer Technique: Simplifying Array ProblemsIntroduction The Two Pointer Technique is a powerful algorithmic approach used to solve a variety of problems in arrays and lists. This technique involves using two pointers to traverse the array or list, often from opposite ends or in a synchronized...10 likesArrayProblems
