Smallest Substring Program in Java
The program must accept a string S as the input. The program must print the smallest substring containing all the distinct…
Half Pyramid Pattern Printing
Half Pyramid Pattern Printing: The program must accept an integer N as the input. The program must print the desired pattern as shown in the…
BST – Leaf Node Count
BST – Leaf Node Count: An array of N positive integers is passed as input. The program must form a binary search tree with these…
Decreasing Sequence from N
Decreasing Sequence from N: Two integers N and D are passed as input. The program must print the decreasing sequence from N to 1 with common…
Collect Max Points
Collect Max Points: A kids game has a board with an M*N matrix having M rows and N columns containing non-negative integer values as cell…
Maximum by Single Digit Replacement
Maximum by Single Digit Replacement: Two integers M and N are passed as the input to the program. The program must print the maximum value of…
Bottle Necks – TCS CodeVita
The program must accept the radii of N bottles as the input. Once a bottle is enclosed inside another bottle, it ceases to be…
Maximum Target Hits in Sequence
In a shooting competition, whenever the target is hit, the score is increased by 1. When the target is missed the score is decreased by 1.…
Move M Words – End Reverse
The program must accept a string S which contains N words and move the first M words to the last in the reverse order. Input format:The first…
Basket with Most Colors
There are N trees in straight line. The trees have different colors of flowers. Each color is represented by an alphabet. N strings are passed…