Given a multi-set of n integers. We have to select exactly k of them in a such way that the difference between any two of them is divisible by m, if it is not possible we will simply return “no” and if it is we will print yes. Examples: Input : 3 2 3 //n,k,m respectively 1 8… Read More »
Given an array of n elements and we have to find the standard deviation of numbers. Examples: Input : arr[] = {9, 2, 5, 4, 12, 7, 8, 11, 9, 3, 7, 4, 12, 5, 4, 10, 9, 6, 9, 4} Output : 2.983 Input : arr[] = {10, 5, 4, 7, 9, 34, 16, 23, 28} Output… Read More »
Given N = no of rows and M = no of columns, print the hollow pattern. ********** * * * * * * ********** Given above is an example of hollow pattern of 5 x 10. Given below is the approach to built hollow pattern: To iterate through rows, run an outer loop from 1 to rows. Define… Read More »
Given a Singly Linked List. The task is to check if the characters in a node is vowel if yes then toggle the case of the vowel. Examples: Input : C-> p-> l-> u-> s-> p-> l-> u-> s Output : C p l U s p l U s The nodes with vowels are ‘u’ toggle the… Read More »
Write a program to validate whether the brackets in the given input string are balanced or not. Examples: Input : {[()]} Output : Valid Input :{{(}}[] Output : Invalid Explanation: This problem is a very common application of stacks in data structures. An opening bracket may be ‘{‘,'[‘,'(‘ and their corresponding closing brackets are ‘}’,’]’,’)’. The brackets are… Read More »
Given an array of N elements, the task is to find the minimum value of K such that Bitwise XOR of K with all array elements is minimum Input: arr[] 16 12 20 18 Output: 16 Explanation: 16^16+12^16+20^16+18^16 =26 Minimum sum Explanation: Check every bit of the numbers and count number of one and zero For minimum sum,… Read More »
In this technological and digital age where everything is automated. We should prefer something which saves time and space and makes our work easy. Lucky for us C++ programmers, we have switch case statements. It is a great alternative to the If else condition statement. It reduces the amount of code to a very small size which saves… Read More »
You are given n commands. The task is to implement a stack that performs operations based on the following commands: push x: Push integer x onto the top of the stack. pop: Pop the top element from the stack. inc k y: Increment the bottom ‘k‘ elements of the stack by value ‘y‘. After each operation, print the… Read More »
Given an Array consisting of N integers, Count the number of contiguous subarrays where each element in the subarray appears 2 or more times. Examples : Input : n = 3 arr = [0, 0, 0] Output : 3 [0],[0],[0] – 0 [0,0],[0,0] – 2 [0,0,0] – 1 Total = 2 + 1 = 3 Input : n… Read More »
Two numbers: m and n are given. The size of these numbers is 32-bit long. You are also given two-bit positions: i and j. You have to set all bits between i and j in m equal to n, i.e., means that n becomes a substring of m located at i and starting at j. Examples: Input :… Read More »
