Problem: Given an integer ‘n’, find sum of all n digits which come in power of 2 of given number n. Examples: Input: p = 9 Output: 8 Explanation : 2^9 = 512 Digit sum : 5 + 1 + 2 = 8 Input: p = 48 Output: 73 Explanation : 2^48 = 281474976710656 Digit sum : 73… Read More »
Given an arithmetic progression and having any number of duplicates, we have to find the index of first occurrence of duplicate element in the series. After getting the index we will remove the duplicates from the series and thus will provide the usual AP series. Note: All duplicates will be adjacent. Examples: Input : arr[] = {2,4,6,6,6,8,10}; Common… Read More »
Sort a list in JAVA and then return the index of elements in sorted order. Examples: Input : [2, 3, 1, 4, 5] Output : [2, 0, 1, 3, 4] After sorting list becomes [1, 2, 3, 4, 5] and their index as [2, 0, 1, 3, 4] Input : [6, 4, 7, 8, 1] Output : [4,… Read More »
Given an array of N integers, where each value represents the volume of the cloud. The task is to choose the two highest volume clouds from an array and smash them together. When two clouds smash then the clouds get condense into water and it rains. If the two highest volume cloud is not equal then the volume… Read More »
Given a string s, the task is to print all permutations of a string that are in ascending order, i.e., their characters are in ascending order. Examples: Input: Cplusplus Output: Cllppssuu Out of all the permutations of the string Cllppssuu is the only string which is sorted. Input: cba Output: abc RECOMMENDED: Characteristics or features of an Algorithm… Read More »
Given an array arr[] of 2N integers, where N is any positive integer. The task is to divide the array into N pairs such that the pair sum minimizes the maximum sum of a pair i.e., the pair sums for this partition are minimum of the maximum pair sum of all possible partitions of the array. Examples: Input… Read More »
We all must have encountered the vertical Traversal of the Binary Tree problem. In this version of the problem we will see how we can perform the traversal vertically while keeping in mind that the order should be from left to right(just like increasing x coordinates): If the x coordinates are same then the node appearing on the… Read More »
Given an array of n integers, you need to find minimum number of below operation such that arrays becomes sorted in non-decreasing order. In a single operation you can rotate the given array clockwise one time. Print -1 if it is not possible to sort the array. Examples: Input: {8, 4, 6} Output: 2 Explanation: After applying operation… Read More »
Given an Integer Stack in Java, sort the stack in increasing order (Ascending Order) Examples: Input : Stack: [10, 2, 16, 5, 9, 1] Peek: 1 Output : Stack: [1, 2, 5, 9, 10, 16] Peek: 16 Recommended: Design and Implement Special Stack Data Structure Approach: The idea is, pop every element from the original stack and compares… Read More »
You are given a string s consisting only of characters ‘a’ and ‘b’. You can delete any number of characters in s to make s balanced. s is balanced if there is no pair of indices (i,j) such that i < j and s[i] = ‘b’ and s[j]= ‘a’. Return the minimum number of deletions needed to make… Read More »