Burning Tree

gfg-potd

Given a binary tree and a node data called target. Find the minimum time required to burn the complete binary tree if the

Kth Smallest

gfg-potd

Given an array arr[] and an integer k where k is smaller than the size of the array, the task is to find the kth smallest element

264. Ugly Number II

leetcode-potd

An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5. Given an integer n, return the nth ugly number. Example 1: Input:

Product array puzzle

gfg-potd

Given an array nums[], construct a Product Array nums[] such that nums[i] is equal to the product of all the elements of nums except nums[i].

Scroll to Top