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 …
The NegaBinary Algorithm – How to Convert to Base Minus Two (-2) ?
We know the binary conversion, which is base two. The algorithm to convert to binary for a decimal integer, is to divide by two and concatenate the remainder in …
Greedy Algorithm to Find the Largest Perimeter Triangle by Sorting
Given an array A of positive lengths, return the largest perimeter of a triangle with non-zero area, formed from 3 of these lengths. If it is impossible to form …