Empowering coders, one solution at a time
Empowering coders, one solution at a time
![[Solved] Level them All Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Level-them-All-Contest-Problem.png "[Solved] Level them All! Contest Problem")
Level them All!: You are given a binary tree and an integer L. Count the number of nodes on that level.Note: L may be greater than maximum possible level. In such case answer is 0 nodes. Input Format:The first line of input…
![[Solved] Strange Median Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Strange-Median-Contest-Problem.png "[Solved] Strange Median Contest Problem")
Strange Median!: You are given a binary search tree. You task is to find the median of sub tree of Kth smallest node of the tree. Input Format:The first line of input contains T denoting the number of testcases. T testcases follow.…
![[Solved] Alternate Leaf Nodes Sum Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Alternate-Leaf-Nodes-Sum-Contest-Problem.png "[Solved] Alternate Leaf Nodes Sum Contest Problem")
Alternate Leaf Nodes Sum: You need to build a BST from the given array A of size N. The array contains distinct elements. You need to build the tree using the Array elements in the order of their arrival (A[0]…
![[Solved] Doubly Linked List Conversion Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Doubly-Linked-List-Conversion-Contest-Problem.png "[Solved] Doubly Linked List Conversion Contest Problem")
Doubly Linked List Conversion: Given a doubly linked with each of the previous pointer assigned to null. Your task is to assign previous pointer to each of previous nodes respectively. Doubly Linked List Conversion Contest Input Format :First line of…
![[Solved] The Conversion To One Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-The-Conversion-To-One-Contest-Problem.png "[Solved] The Conversion To One Contest Problem")
The Conversion To One: You are given a number N. You need to convert it to 1 in minimum number of operations. The operations allowed are as follows: If N is even then divide the number by 2. If N…
![[Solved] Get the Shadow Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Get-the-Shadow-Contest-Problem.png "[Solved] Get the Shadow Contest Problem")
Get the Shadow: Given an unsorted array A[] of size N of positive integers. One number ‘a’ from set {1, 2, N} is missing and one number ‘b’ occurs twice in array. The task is to find the repeating and…
Nearest Perfect Square: You are given a number N. You need to find the perfect square that is nearest to it. If two perfect squares are at the same distance to N, then print the greater perfect square. Nearest Perfect…
![[Solved] A Boolean Matrix Problem Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-A-Boolean-Matrix-Problem-Contest-Problem.png "[Solved] A Boolean Matrix Problem Contest Problem")
A Boolean Matrix Problem: You are given a matrix Mat of m rows and n columns. The matrix is boolean so the elements of the matrix can only be either 0 or 1.Now, if any row of the matrix contains…
![[Solved] Without Adjacent Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Without-Adjacent-Contest-Problem.png "[Solved] Without Adjacent Contest Problem")
Without Adjacent: Given an array arr[] of N positive integers. The task is to find a subsequence with maximum sum such that there should be no adjacent elements from the array in the subsequence. Without Adjacent Contest Input:First line of…
![[Solved] Toggle The Middle Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Toggle-The-Middle-Contest-Problem.png "[Solved] Toggle The Middle Contest Problem")
Toggle The Middle: You are given a number N. You need to toggle the middle bit of N in binary form and print the result in decimal form. If number of bits in binary form of N are odd then…