Nov 3, 2025 · 19 min read · Sorting Algorithms KMP (Knuth–Morris–Pratt) Algorithm Core idea Build a table of how far to "jump back" in the pattern when a mismatch happens, using the pattern's internal prefix-suffix structure. Then scan the text once, reusing previous partial ma...
Join discussion
Jun 12, 2025 · 4 min read · Preparing for coding interviews? This blog series shall help you practice some of the most commonly asked data structure problems in top tech companies. Each post will include: A clear explanation of the problem A simple and efficient solution (in ...
Join discussion
Mar 3, 2025 · 1 min read · 🔗 Link bài toán: Majority Element 🔺 Mô tả bài toán:Cho một mảng số nguyên nums có kích thước n, hãy tìm phần tử xuất hiện nhiều hơn ⌊n / 2⌋ lần. Bạn có thể giả định rằng luôn tồn tại một phần tử như vậy. 💡 Ý tưởng:Bài toán này có thể được giải quy...
Join discussionJan 11, 2025 · 8 min read · Introduction String searching is a fundamental problem in computer science, where the goal is to find a substring (the "pattern") within a larger string (the "text"). This problem has numerous applications in areas like text editors, DNA sequence ana...
Join discussion
