## KARAN’S RELATIVES

CONCEPTS USED: Greedy algorithm, Kruskal's algorithm. DIFFICULTY LEVEL: PROBLEM STATEMENT(SIMPLIFIED): Karan's came home after a long time and he wants to visit all the relatives. The total number of Karan's's...

Skip to content
## KARAN’S RELATIVES

## First character

## Code Characters

## Maximize The Boxes

## Floor of a number

## Generate all Pairs of 0 and 1

## Factorial Zeros

## Get the Sun Light

## Find Maximum

## Find the Missing

CONCEPTS USED: Greedy algorithm, Kruskal's algorithm. DIFFICULTY LEVEL: PROBLEM STATEMENT(SIMPLIFIED): Karan's came home after a long time and he wants to visit all the relatives. The total number of Karan's's...

Concepts Used String, Hashing Difficulty Level Easy Problem Statement (Simplified): Find the first non-repeating character in the string, print -1 if all characters are repeating. See original problem statement here...

Concepts Used String Difficulty Level Easy Problem Statement (Simplified): Find the minimum length of substring, which on replacing with any other substring of the same length gives a string containing...

CONCEPTS USED: Searching, Basic Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given chocolates of 3 types A, B, C with their frequencies f_A,f_B and f_C, you need to pack these chocolates...

CONCEPTS USED: Searching DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a sorted array A and a number x. find the largest value in the array that is less than or equal...

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given N pairs of Binary Numbers 0 and 1, your task is to generate all possible combinations such that for each 0...

CONCEPTS USED: Binary Search, Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a number N, your task is to find the count of all such numbers that have N trailing zeros...

CONCEPTS USED: Searching DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given an array A of unique heights of buildings. The sun is facing buildings from left to right, print the number of...

CONCEPTS USED: Arrays DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array A of N positive integers. The task is to find the maximum of j - i such that A[j]...

CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N-1 elements, with elements from 1 to N present into it. Find a single missing element....