Problem – Write a program in 8086 microprocessor to find out the sum of two arrays of 8-bit n numbers, where size “n” is stored at offset 500 and...

Share

Problem – Write a program in 8086 microprocessor to find out the subtraction of corresponding elements of two arrays of 8-bit n numbers, where size “n&#...

Share

Given two sorted arrays of size m and n respectively, you are tasked with finding the element that would be at the k’th position of the final sorted array.
Exa...

Share

Given three positive integers n, k and x. The task is to count the number of different array that can be formed of size n such that each element is between 1 to k and...

Share

Given an Array of Integers and an Integer value k, find out k non-overlapping sub-arrays which have k maximum sums.
Examples:
...

Share

Given two arrays of positive integers of size m and n where m > n. We need to maximize the dot product by inserting zeros in the second array but we cannot disturb...

Share

We are given two arrays, we need to find the longest possible bitonic sequence such that increasing part must be from first array and should be a subsequence of first...

Share

Given an Array of Integers and an Integer value k, find out k sub-arrays(may be overlapping) which have k maximum sums.
Examples:
Input : arr = {4, -8, 9, -4, 1, -8, ...

Share

Given two positive integer n and n. The task is to find the number of arrays of size n that can be formed such that :
Each element is in range [1, m]
All adjacent ...

Share

Given n arrays of size m each. Find the maximum sum obtained by selecting a number from each array such that the elements selected from the i-th array are more than t...

Share