Harsh Jaiswal·4d agoBeyond Basic Trie: Exploring DFS, Backtracking, and Prefix-Based SearchingTrie is one of those data structures that becomes much more interesting when we move beyond simple word insertion and searching.
Subhankar Jena·Sep 10LPS Array Explained: How to Build It Step by Step in JavaScriptIf you’ve started learning the KMP (Knuth–Morris–Pratt) algorithm, you’ve probably come across something called an LPS array.
Subhankar Jena·Sep 10Prefix, Suffix, Proper Prefix & Proper Suffix Explained — A Beginner’s GuideIf you’re starting Data Structures and Algorithms, you’ll eventually come across words like:
