Problem: Implement the version control map system which takes the snapshot of the versions of data. Implement the following functions: put(key, value) – puts the value again the key in the latest version of the map get(key) – get the value of the key for the latest version of the data snapshot() – take a … Read more Implement/Design the version control map system
Objective: Given a map which has String as key and Integer as value. Write a program to sort the map in descending order according to the values. Example: Given Map: Joe : 1000 Earl : 1200 Carl : 2000 Brad : 1510 Dow : 500 Sorted Map: Carl : 2000 Brad : 1510 Earl : … Read more Sort Map as per values – Java Program
Objective: Interval is defined as [start, end]- the start of an interval to the end of the interval. Given a list of Intervals. Your task is to check if any two intervals overlap. Example: Given Interval: [[1,5], [6,10], [12,15], [3,7]] Two intervals are present which intersect Given Interval: [[1,5], [6,10], [12,15]] No intervals overlasx Approach: … Read more Find if any two intervals overlap in given intervals
Objective: Given an array of integers, write a program to find the number of pairs with even odd. Example: Given Input: [1, 2, 3, 4] Number of odd pairs: 4 Note: (1, 2), (1, 4), (2, 3) and (3, 4) Given Input: [6, 7, 1, 3, 2, 5, 4] Number of odd pairs Naive approach: … Read more Given an array, find the number of all pairs with odd sum.
Objective: Given an array of integers and number N, Write an algorithm to find and print all the unique subsets of array for which sum is equal to N where array elements can be repeated any number of times. Example: int [] arrA={2,4,3} sum =6 Output: [2, 2, 2] [2, 4] [3, 3] int [] … Read more Given an array, find all unique subsets with a given sum with allowed repeated digits.
Objective: Given two strings, source string and target string, which are permutation or anagram of each other. You are allowed two swap only consecutive characters. Write an algorithm to print all the steps ( all the swaps) which will lead the conversion of the source string to the target string. NOTE: There could be multiple … Read more Print all steps to convert one string to another string
Objective: Given an array of integers (in particular order or permutation of a set of numbers), write an algorithm to find the lexicographically next permutation of the given permutation with only one swap. This problem can also be asked as “Given a permutation of numbers you need to find the next larger permutation OR smallest … Read more Lexicographically next permutation With One swap
Objective: Given two integers N and K, Write an algorithm to find subsets of size K from the numbers 1 to N. Example: N = 5 K = 3 Output: [1, 2, 3] [1, 2, 4] [1, 2, 5] [1, 3, 4] [1, 3, 5] [1, 4, 5] [2, 3, 4] [2, 3, 5] [2, … Read more Find all subsets of size K from a given number N (1 to N)
Objective: Given two integers N and K, Write an algorithm to find possible combinations that add to K, from the numbers 1 to N. Condition: An integer from 1 to N can be repeated any number of times in combination. Example: N = 5 K = 3 Output: [1, 1, 1] [1, 2] [3] N … Read more Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed
Objective: Given an array of integers, write an algorithm to construct the largest number possible by appending the array elements. Example: Given Input: [7, 78] Largest Number Possible: 787 Explanation: two possibilities are 778 and 787. 787 is larger than 778. Given Input: [25, 42, 39] Largest Number Possible: 423925 Approach: Normal sorting in descending … Read more Construct the largest number from the given array.
Objective: Given an array of integers, find the sum of any three elements which is closest to zero. The array may contain positive and negative elements. Example: Given Input: [-1, 4, -2, 5, 10, -5] Minimum Sum with three elements is: 1 Explanation: -1, 4, -2 sums to -1 Given Input: [-1, 4, -2, 5, … Read more Given an array, find three-element sum closest to Zero
Objective: Given an array of integers and number N, Write an algorithm to find and print all the subsets of the array for which sum is equal to N. Example: input [] = {6,2,7,8,2,4,1,3,7,5} Sum = 8 Output: [1, 2, 2, 3] [1, 2, 5] [1, 3, 4] [1, 7] [2, 2, 4] [2, 6] … Read more Given an array, print all unique subsets with a given sum.
Objective: Given an array of numbers and integer K. Your task is to find lengths of all the subsets which contain value K and all elements in the subset are less than equal to K. Example: Given Input: [1, 5, 2, 3, 8, 6, 2, 4, 9, 5, 2], and K = 5 Length of … Read more Sum of length of subsets which contains given value K and all elements in subsets are less than equal to K.
Objective: Given an array of integers, write a program to replace its elements with the maximum element on the right side from their respective positions. Note: If the element is equal to the maximum element on the right, replace it with 0. Example: Original Array: [2, 5, 1, 6, 3, 4] Output: [6, 6, 6, … Read more Replace array elements with maximum element on the right.
Objective: Given an integer N, Write an algorithm to select numbers from 1 to 9 and make combinations such that its sum to N. Example: N= 5 Output: [1, 4] [2, 3] [5] N =12 [1, 2, 3, 6] [1, 2, 4, 5] [1, 2, 9] [1, 3, 8] [1, 4, 7] [1, 5, 6] … Read more Find all unique combinations of numbers (from 1 to 9 ) with sum to N