Depth First Search Algorithm to Delete Insufficient Nodes in Root to Leaf Paths in Binary Tree
Given the root of a binary tree, consider all root to leaf paths: paths from the root to any leaf. (A leaf is a node with no children.) A …
Category: algorithms
C/C++ Program to Compute the Angle Between Hands of a Clock
Given two numbers, hour and minutes. Return the smaller angle (in sexagesimal units) formed between the hour and the minute hand. Example 1: Input: hour = 12, minutes = …
Iterative and Recursion Algorithms to Compute the Number of Steps to Reduce a Number to Zero
Given a non-negative integer num, return the number of steps to reduce it to zero. If the current number is even, you have to divide it by 2, otherwise, …
Dynamic Programming Algorithm to Count Vowels Permutation
Given an integer n, your task is to count how many strings of length n can be formed under the following rules: Each character is a lower case vowel …
How to Break a Palindrome String by Replacing a Character?
Given a palindromic string palindrome, replace exactly one character by any lowercase English letter so that the string becomes the lexicographically smallest possible string that isn’t a palindrome. After …