Recursive Depth First Search Algorithm to Delete Leaves With a Given Value in a Binary Tree
Given a binary tree root and an integer target, delete all the leaf nodes with value target. Note that once you delete a leaf node with value target, if …
Algorithms to Determine a Palindrome Number
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Example 1: Input: 121 Output: true Example 2: Input: …
Algorithm to Compute the Fraction to Recurring Decimal of the Two Integer Division
Given two integers representing the numerator and denominator of a fraction, return the fraction in string format. If the fractional part is repeating, enclose the repeating part in parentheses. …
Algorithms to Check if Array Contains Duplicate Elements
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it …
Recursive Depth First Search Algorithm to Compute the Sum of Nodes with Even-Valued Grandparent in a Binary Tree
Given a binary tree, return the sum of values of nodes with even-valued grandparent. (A grandparent of a node is the parent of its parent, if it exists.) If …
How to Convert Integer to the Sum of Two No-Zero Integers?
Given an integer n. No-Zero integer is a positive integer which doesn’t contain any 0 in its decimal representation. Return a list of two integers where: A and B …