gfg-potd

Given a string, find the minimum number of characters to be inserted to convert it to a palindrome. Examples : […]

Given a string str and an integer k, return true if the string can be changed into a pangram after at most k operations, else

Given a sorted array. Convert it into a Height Balanced Binary Search Tree (BST). Return the root of the BST. Height-balanced BST means a binary tree in

Given the root of a binary tree. Check whether it is a BST or not.Note: We are considering that BSTs can not

Given two BSTs, return elements of merged BSTs in sorted form. Examples : Input: BST1: 5   / \   3 6

Given a binary tree. Find the size of its largest subtree which is a Binary Search Tree.Note: Here Size equals the number of

Given an array arr. The task is to find and return the maximum product possible with the subset of elements present in the

You are given a binary tree and you need to remove all the half nodes (which have only one child). Return the

Given an array arr containing positive integers. Count and return an array ans where ans[i] denotes the number of smaller elements on right side of arr[i]. Examples:

You are given an array arr. Your task is to find the longest length of a good sequence. A good sequence {x1, x2, .. xn}

Given an array parent that is used to represent a tree. The array indices (0-based indexing) are the values of the tree

Given a string s without spaces, a character ch and an integer count. Your task is to return the substring that remains after the character ch has appeared count number