Bruteforce Algorithm to Find the Next Closet Time Reusing the Current Digits
Given a time represented in the format “HH:MM”, form the next closest time by reusing the current digits. There is no limit on how many times a digit can …
The Overlapping Rectangles using CSS and Javascript
Make three rectangles (Div or Span containers) as shown in the above figure. Clicking on any rectangle should display (using alert is fine) the name of the rectangle. Three …
How to Count the Distinct Pairs using HashMap?
Given an array of integers and a target value, find the number of distinct pairs that sum to the target. The pairs (x,y) and (x’, y’) where x smaller …
Comparing Left and Right Branch of a Complete Binary Tree
A complete binary tree is a binary tree that each level except possibiliy the last level, is completed filled. Suppose you are giving a binary tree represented as an …
How to Find Words That Can Be Formed by Characters?
You are given an array of strings words and a string chars. A string is good if it can be formed by characters from chars (each character can only …
How to Compute the Maximum Difference Between Node and Ancestor?
Given the root of a binary tree, find the maximum value V for which there exists different nodes A and B where V = |A.val – B.val| and A …