algorithm tutorial

Code Mala Tang

Apr 12, 2025 · Fundamentals

Mastering Manacher’s Algorithm: Find the Longest Palindromic Substring in O(N)

Manacher’s algorithm transforms the classic longest palindromic substring problem into a linear‑time solution by preprocessing the string with separators, tracking palindrome radii, and efficiently updating the center and right boundary using mirror positions, with detailed Python code and step‑by‑step illustrations.

Manacher algorithmPythonalgorithm tutorial

0 likes · 12 min read

Mastering Manacher’s Algorithm: Find the Longest Palindromic Substring in O(N)

Selected Java Interview Questions

Feb 22, 2021 · Fundamentals

Eight Common Sorting Algorithms in Java with Full Code Implementations

This article explains eight classic sorting algorithms—direct insertion sort, Shell sort, simple selection sort, heap sort, bubble sort, quick sort, merge sort, and radix sort—detailing their step‑by‑step logic, when to use each, and providing complete Java code examples for every method.

Data Structuresalgorithm tutorialcomputer science fundamentals

0 likes · 13 min read

Eight Common Sorting Algorithms in Java with Full Code Implementations

360 Tech Engineering

Dec 11, 2020 · Fundamentals

Heap Sort: Theory, Implementation, and Step‑by‑Step Explanation

This article explains the heap sort algorithm, describing the heap data structure, the process of building a max‑heap, the sorting loop with element swaps, and provides detailed Java code examples along with key points and an illustrative example array.

Data Structuresalgorithm tutorialheap sort

0 likes · 5 min read

Heap Sort: Theory, Implementation, and Step‑by‑Step Explanation