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 …
Tag: c++
Depth First Search Algorithm to Compute the Longest Tree Sum Path From Root to Leaf
Given a binary tree root, return the sum of the longest path from the root to a leaf node. If there are two equally long paths, return the larger …
Count the Unique AB Strings by Permutation
You are given a string s of “a” and “b”s. “a”s can stay “a” or turn into “b”, but “b”s can’t change. Return the number of unique strings that …
Binary Search Algorithm to Find Next Node on Its Right in a Binary Tree
You are given a binary tree root containing unique values, and an integer target. Find the node with value target and return the node that’s directly right of it …
Dynamic Programming Algorithms to Compute the Longest Chain of Blocks
You are given a list blocks where each block contains two integers where start < end. You can join two blocks if the end of one is equal to …