## Sudo Placement[1.7] | Greatest Digital Root

Given a number N, you need to find a divisor of N such that the Digital Root of that divisor is the greatest among all… Read More »

## Sudo Placement[1.5] | Second Smallest in Range

Given an array of N integers and Q queries. Every query consists of L and R. The task is to print the second smallest element… Read More »

## Sudo Placement[1.5] | Partition

Given an array of positive and negative numbers. The task is to find a partition point such that none of the elements of left array… Read More »

## Sudo Placement[1.5] | Wolfish

Given a N x N matrix where value at cell (i, j) is the cost of moving from a cell (i, j) to cell (i… Read More »

## Sudo Placement[1.4] | Jumping the Subtree

Given a binary search tree of n nodes with distinct values. Also given are Q queries. Each query consists of a node value that has… Read More »

## Sudo Placement[1.4] | BST Traversal

Given N elements to be inserted into Binary Search Tree. The task is to construct a binary search tree with only insert operation and finally… Read More »

## Sudo Placement[1.3] | Playing with Stacks

You are given 3 stacks, A(Input Stack), B(Auxiliary Stack) and C(Output Stack). Initially stack A contains numbers from 1 to N, you need to transfer… Read More »

## Sudo Placement[1.3] | Final Destination

Given an array of integers and a number K with initial and final values. Your task is to find the minimum number of steps required… Read More »

## Sudo Placement[1.3] | Stack Design

Given q number of queries, you need to perform operations on the stack. Queries are of three types 1, 2 and 3. If the operation… Read More »

## Sudo Placement | Beautiful Pairs

Given two arrays of integers where maximum size of first array is big and that of second array is small. Your task is to find… Read More »

## Sudo Placement | Placement Tour

Given an array A of N positive integers and a budget B. Your task is to decide the maximum number of elements to be picked… Read More »

## Sudo Placement 2 | Matrix Series

A Matrix series is defined as follows: M, MT, M(MT), M(MT)2, M2(MT)3, M3(MT)5, M5(MT)8 . . . . . . . ., where M is a… Read More »

## Sudo Placement | Palindrome Family

Given a string of lowercase characters, the task is to detect the family of string, where family of string is described as follows. ODD Palindrome… Read More »

## Sudo Placement | Range Queries

Given Q queries, with each query consisting of two integers L and R, the task is to find the total numbers between L and R… Read More »