For the given hour and minute let say “hh” and “mm” print the next sooner palindromic time. Example: Input: hh = 02 mm = 03 Output: 02:20 Explaination:For the hour 02 and minute 03 the next sooner palindromic time is 02:20 Input hh = 04 mm = 45 Output: 05:50 Explaination:For the hour 04 and minute 45 the… Read More »
Given an array of integers. The task is to find the Minimum index of repeating element in an array in linear time and in a single traversal of the array. Examples: Input : {5, 6, 2, 1, 6, 1, 2} Output : Minimum index of repeating element is 1 Input : {1, 2, 5, 6, 7} Output :… Read More »
Given an array of size N. The task is to choose an arbitrary pair of elements from the Array such that their sum is even, delete these two elements from the Array and insert their sum into the sequence instead. And finally, count the number of elements remaining in the array at the end. Examples: Input:N = 2,… Read More »
There are N student from class 12th,each student finished thier exam and exam consist with four subjects like math, computer, physics and chemistory. Result is announced and result list consist with student identity number with their corresponding marks scored in each subject. Our task is to find ranked student among the N student. Example: Suppose there are 5… Read More »
Given a list of elements p, the task is to convert the whole list into a list of sets. Examples: Input: p = [‘apple’, ‘banana’, ‘cherry’] Output: [{‘apple’}, {‘banana’}, {‘cherry’}] Explanation : Here each element of the list is converted into a set. Input: p = [1, 2, 3, 4] Output: [{1}, {2}, {3}, {4}] Approach : Initialize… Read More »
We have to create an inverse triangle in the form of numbers (decreasing order). Example: If the user provide 5. The print 5, 5 times ; 4, 4 times and so on. As- 5 5 5 5 5 4 4 4 4 3 3 3 2 2 1 Implementation: First we declare a variable – number and assign… Read More »
Given a number N, the task is to print all duplicate digits of that number in sorted order. Examples: Input: 123412989 Output : 3 4 8 Explanation : The unique digits are 3 4 8 Input : 9832213789 Output: 1 7 Approach: The idea is to use The idea is to use Hashing to store the frequency of… Read More »
Given a Rooted Tree with n node, labeled from 1 to n and tree is rooted at node 1. Parent of i-th node is p[i], i is starting from 2 as 1 is always root node. Let f(L) denotes the smallest connected subgraph that contains all leaves L. The task is to count the number of ways to… Read More »
Given an integer array arr[], the task is to find the number of triplets at distinct indices that can be removed from the array such that the mean remains the same as before. Example: Input: arr[]= { 8, 7, 4, 6, 3, 0, 7} Output: 3 Explanation: The mean of the array is (8+7+4+6+2+1+7)/7 = 5 On removal… Read More »
Given a non negative number, you are required to find whether or not the number can be composed from sum of some number of 7s, 5s and 3s i.e. if a number is of the format n=3x+5y+7z (x, y, z being non negative integers), if not print -1. If it is of the required format, print the number… Read More »
