Given an array arr[] of n positive integers and q queries, in which each query have an integer k. For each query, the task is to output the minimum size of subarray whose binary representation of each elements if concatenated will have at least k number of set bits. If no such array exist, print -1. Examples: Input… Read More »
Given a sorted rotated array, the task is to find index of minimum element of the array. Following solution assumes that all elements are distinct. Examples: Input : arr[] = {5, 6, 1, 2, 3, 4} Output : 2 Minimum element in the array is 1, hence index will be 2 Input : arr[] = {2, 3, 4,… Read More »
Given an array of integers, write a function that returns true if there is a triplet (a, b, c) that satisfies a2+b2=c2 Example: Input: arr[] = {8, 1, 4, 6, 10} Output: True There is a Pythagorean triplet (8, 6, 10). Input: arr[] = {1, 2, 4, 3} Output: False There is no Pythagorean triplet. Approach: The problem… Read More »
Given a string find the character which occurs a minimum number of times. Note: If multiple such characters exist output anyone. Example: Input: S = abbccdd Output: a As frequency of every element is more than that of a Input: S = abccdd Output: b or Output: a Both the outputs are acceptable according to given conditions. Naive… Read More »
Write an efficient C program to find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum. Examples: Input : {-2, -3, 4, -1, -2, 1, 5, -3} Output : 7 The subarray {4,-1,-2,1,5} gives the maximum sum among all other possible sub-arrays. Algorithmic Paradigm: Divide And Conquer To apply Divide and… Read More »
Given a string A, compute the minimum number of characters you need to delete to make resulting string a palindrome. Examples: Input : baca Output : 1 Input : cplusplus Output : 6 Below approach will use modified Levensthein distance. We would like to pass to modified Levensthein both original string and its reverse. C++ Implementation: Output: To… Read More »
Given a binary array consisting of only 0s and 1s, find the maximum distance between two elements with value 0 in a subarray {l,r}. Examples: Input : arr = {1,0,0,1}, l=0, r=3 Output : 1 Clearly, in the range from 0 to 3, first 0 lies at index 1 and last at index 2. Hence, the distance 2-1… Read More »
C++ is Object-Oriented Programming (OOP) language. C++ is easy to understand. You can learn C++ by following these steps: Writing your program in a text editor. Then saving it with the appropriate file extension (e.g., .cpp, .c, .cp). Compiling your program using a compiler or an online Integrated Development Environment (IDE). Understanding of the basic terminologies. Writing First… Read More »
In C/C++, the fork() function is used to generate a new process known as the child process. We can do searching within a fork() process. Problem statement – Write a program to search the key element in parent process and print the key to be searched in child process. Examples: Input : Key=7; array[5] = { 2, 5,… Read More »
C++ is programming language. It is object-oriented, and generic programming paradigms. C++ is compatible with multiple platforms such as Windows, Linux, Unix, and Mac. Using Online IDE Before starting C++ programming, it is necessary to set up an environment on your local computer to compile and execute C++ programs. You can also use Online Integrated Development Environments (IDEs)… Read More »
