Recursive Algorithm to Cut a Binary Search Tree (Remove Nodes Not In Range)
Given a binary search tree root, an integer lo, and another an integer hi, remove all nodes that are not between inclusive. Constraints n ≤ 100,000 where n is …
Category: c / c++
Breadth First Search Algorithm to Compute the Leftmost Deepest Tree Node in a Binary Tree
Given a binary tree root, find the value of the deepest node. If there’s more than one deepest node, then return the leftmost one. Constraints n ≤ 100,000 where …
Hash Algorithm to Check A List Containing Almost Same Strings (Differ By One Character)
You are given a list of lowercase alphabet strings words where each string is of the same length. Return whether there’s two strings that differ only in one index. …
Two Pointer Algorithm to Count the Sum of Three Numbers Less than Target
Given a list of integers nums and an integer target, return the number of triples i < j < k that exist such that nums + nums + nums …
Algorithms to Count the Equivalent Pairs in an Array
You are given a list of integers nums. Return the number of pairs i < j such that nums = nums. Constraints 0 ≤ n ≤ 100,000 where n …