Given a binary tree, a target node and a positive integer K on it, the task is to find the sum of all nodes within… Read More
Category Archives: Searching
Given an array A[] containing N elements of an array and their frequency in that array (say arr[]), the task is to find the median… Read More
Given an array arr[] of size N representing the time taken by a person to complete a task. Also, an array restTime[] which denotes the… Read More
Given an array arr[] of size N and an integer K, the task is to minimize the value of the maximum element of the array… Read More
Given an array A[] having N non-negative integers, find a pair of indices i and j such that the absolute difference between them is same… Read More
Given an array, arr[] of size N and a positive integer D, the task is to find the position i of an element in arr[]… Read More
Given a string str and K pair of characters, the task is to check if string str can be made Palindrome, by replacing one character… Read More
Given a sorted array arr[] of size N, where arr[i] denotes the starting position of a sequence, the task is to find the minimum number… Read More
Given an array task[] of size N denoting amount of work to be done for each task, the problem is to find the minimum amount… Read More
Given an array Arr[ ] of N integers where 1 ≤ N ≤ 105. The task is to choose any number of elements from the… Read More
Given a 2D array A[][] of size N x 2 where: Every element lies between [1, N]. A[i][0] signifies that there must be at most… Read More
Given a Grid of size NxM, and two integers X and Y, the task is to count the minimum number of rows between the row… Read More
Given a binary tree of N nodes. Count the frequency of an integer K in the binary tree. Examples: Input: N = 7, K =… Read More
Given a binary tree having N nodes, the task is to find the level having the maximum number of setbits. Note: If two levels have… Read More
Courses
