What and Why? Algorithms are a well-ordered sequence of instructions that are used to solve a particular problem. The algorithm design technique is a strategy of developing an efficient algorithm to solve a problem or to do any computations. Various algorithm techniques are implemented to reach higher performance which is measured in terms of efficiencies. Here, the efficiency… 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 »
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 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 »
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 »
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 »
We have to print the pattern as given in the example below : Examples: Input : 4 Output : 1 1 12 21 123 321 12344321 123 321 12 21 1 1 Input : 5 Output : 1 1 12 21 123 321 1234 4321 1234554321 1234 4321 123 321 12 21 1 1 Approach : You can… Read More »
