๐๏ธDisk Scheduling AlgorithmsDisk scheduling algorithms govern the way the read/write head moves in order to serve the requests.๐๏ธMoore's Voting AlgorithmEfficient for recognizing the element which appears more than half in a given dataset๐๏ธThread CreationThread creation is the allocation and initialization of a new, independent execution stream within an existing process's memory space to enable concurrent task performance.๐๏ธBalanced Binary Tree (Python)3 items available๐๏ธKMP searching pattern1 item available๐๏ธString Algorithms6 items available ๐๏ธBasic Data Structures and Algorithms6 items available๐๏ธHashing in DSA9 items available๐๏ธRecursion23 items available๐๏ธSliding Window7 items available๐๏ธStacks14 items available๐๏ธBinary Search13 items available๐๏ธBinary Search Tree10 items available๐๏ธBinary Trees9 items available๐๏ธBit Manipulation7 items available๐๏ธCombinatorics3 items available๐๏ธComplexity4 items available๐๏ธHeap11 items available๐๏ธObject-Oriented Programming (OOPs) Concepts10 items available๐๏ธAlgorithms43 items available๐๏ธPrefix Sum & Difference Array4 items available๐๏ธTask Scheduling1 item available๐๏ธAdvanced Data Structures10 items available๐๏ธQueue11 items available๐๏ธChallengeSolutions4 items available๐๏ธMemory Allocation Algorithms3 items available๐๏ธGraphs30 items available๐๏ธLinked List20 items available๐๏ธDynamic Programming20 items available๐๏ธHash tables3 items available๐๏ธRed-Black TreeA complete guide to Red-Black Trees -- self-balancing binary search trees with color-based balancing, properties, rotations, and implementations.๐๏ธTrie (Prefix Tree)A complete guide to Trie data structure -- a tree-based data structure for efficient string operations like prefix matching, autocomplete, and IP routing.๐๏ธBloom FilterA complete guide to Bloom Filter -- a probabilistic data structure for membership testing with space efficiency, false positives, and practical applications.๐๏ธAho-Corasick AlgorithmA complete guide to the Aho-Corasick algorithm for efficient multi-pattern string matching using a Trie and failure links, with implementations.๐๏ธLRU CacheA complete guide to LRU (Least Recently Used) Cache -- a caching strategy using doubly linked lists and hash maps to achieve O(1) get and put operations.๐๏ธApproximation Algorithm1 item available๐๏ธBanker's Algorithm1 item available๐๏ธBoyer Moore1 item available๐๏ธCircular_array2 items available๐๏ธDivide and Conquer3 items available๐๏ธFenwick Tree1 item available๐๏ธJump SearchThis post explores the use of Jump Search Algorithm. We'll provide code implementations C++.๐๏ธNumber theory8 items available๐๏ธRabin-Karp Algorithm1 item available๐๏ธRandomized Algorithm2 items available๐๏ธRecursion-depths5 items available๐๏ธSegment-Trees3 items available๐๏ธStandard Template Library4 items available๐๏ธTarjan's Algorithm1 item available๐๏ธTrees14 items available๐๏ธTries5 items available๐๏ธb-tree3 items available๐๏ธbacktracking algorithms3 items available๐๏ธbinary-search-problems2 items available๐๏ธcomputational-geometry1 item available๐๏ธcpu-scheduling-algorithms6 items available๐๏ธdocumentation-enhancements1 item available๐๏ธfundamentals3 items available๐๏ธgame-Theory2 items available๐๏ธgreedy-algorithms8 items available๐๏ธKnapsack for Disaster ReliefSolving the 0/1 Knapsack problem to optimize the packing of supplies for disaster relief missions.๐๏ธmachine-learning46 items available๐๏ธpage-replacement-algorithms3 items available๐๏ธIntroduction to Sortings6 items available
๐๏ธDisk Scheduling AlgorithmsDisk scheduling algorithms govern the way the read/write head moves in order to serve the requests.
๐๏ธMoore's Voting AlgorithmEfficient for recognizing the element which appears more than half in a given dataset
๐๏ธThread CreationThread creation is the allocation and initialization of a new, independent execution stream within an existing process's memory space to enable concurrent task performance.
๐๏ธRed-Black TreeA complete guide to Red-Black Trees -- self-balancing binary search trees with color-based balancing, properties, rotations, and implementations.
๐๏ธTrie (Prefix Tree)A complete guide to Trie data structure -- a tree-based data structure for efficient string operations like prefix matching, autocomplete, and IP routing.
๐๏ธBloom FilterA complete guide to Bloom Filter -- a probabilistic data structure for membership testing with space efficiency, false positives, and practical applications.
๐๏ธAho-Corasick AlgorithmA complete guide to the Aho-Corasick algorithm for efficient multi-pattern string matching using a Trie and failure links, with implementations.
๐๏ธLRU CacheA complete guide to LRU (Least Recently Used) Cache -- a caching strategy using doubly linked lists and hash maps to achieve O(1) get and put operations.
๐๏ธJump SearchThis post explores the use of Jump Search Algorithm. We'll provide code implementations C++.
๐๏ธKnapsack for Disaster ReliefSolving the 0/1 Knapsack problem to optimize the packing of supplies for disaster relief missions.