Given 2 sorted arrays A and B of size N each. Print the sum of the middle elements of the array obtained after merging the given arrays. Examples: Input: arr1: 1 2 4 6 10 Input: arr2: 4 5 6 9 12 Output: 11 (5 + 6) The approach is similar to that of Merge function of Merge… Read More »
There is an array arr[] of length N. Your task is to find the sum of the minimum elements of each possible sub-array of the array. Examples: Input : arr[] = {2, 4, 6, 8, 10} Output : 75 Explanation : Min of all sub-arrays: {2} – 2 {2, 4} – 2 {2, 4, 6} – 2 {2,… 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 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 »
Data structures are fundamental tools that every programmer must be familiar with. They are used to organize and manipulate data in a way that makes programming more efficient and effective. In this article, we will explore some of the most important data structures that every programmer should know, along with examples in C++. 1. Arrays Arrays are one… Read More »
In C programming language, a string is a sequence of characters that are stored in an array of characters. The string is terminated with a null character (‘\0’) which marks the end of the string. In C, strings are stored as arrays of characters, and each character in the array represents a character in the string. For example,… 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 »
