Algorithms to Count the Number of Palindromic Substrings
Given a string, your task is to count how many palindromic substrings in this string. The substrings with different start indexes or end indexes are counted as different substrings …
Category: algorithms
Algorithm of Two Pointer (Sliding Windows) to Find All Anagrams in a String
Given a string s and a non-empty string p, find all the start indices of p’s anagrams in s. Strings consists of lowercase English letters only and the length …
Depth First Search Algorithm to Find Leaves of a Binary Tree
Given a binary tree, collect a tree’s nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example: Input: 1 / …
Breadth First Search Algorithm to Check Completeness of a Binary Tree?
Given a binary tree, determine if it is a complete binary tree. Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly …
Algorithms to Remove All Adjacent Duplicates In a String
Given a string S of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them. We repeatedly make duplicate removals on S until …