GeeksforGeeks

find the median of two sorted arrays. Eg. a1[] = {1, 2, 7, 8} a2[] = {3, 9, 12, 23}, then find the median of the array created by merging them, ie {1 2 3 7 8 9 12 23}

given an array of n number, one number is repeated n/2 times. Find the number.

given a large file containing orders placed in a day. Find the top k order with maximum costs.

compare linked list and arrays

Rotate an array using reverse function.

Hi pls help me solving the below problem.How to solve it and what will be the answer
An array A[M][N] on anti-clock wise roatation becomes A'[N][M].
Derive a relation A[i][j]=A'[][] interms of M,N,i,j where i , j starts
from 0 base.

A’

1 2 3
4 5 6

A
6 3
5 2
4 1

merge n sorted array such that resultant array is also sorted.

In a given array int num[10] ={1,-5,6,7,9,9,20,25,31,45} it is a sorted array. write a function void findsum(int [],int x) int [] is array and x is number. function should print all possible pair of elements in array that can make a sum equal to x. for example if value of x is 26 then function should print
1,25
25,1
-5,31
31,-5
Function should be implemented using O(N) or O(2N) approach try to avoid using O(N 2) approach (Means avo...

You are given an array. One integer is in the array twice and others appear once. Find that no. O(n) solution

Best method to find out whether a given array already sorted,is sorted or not in min. time

Given an array with some repeating numbers, sort the array according to number of occurrences of characters.

Example 1 : 1, 6, 5, 1, 6, 1 Output 1 : 1, 1, 1, 6, 6, 5
Example 2 : 10 10 2 2 7 7 7 Output 2 : 7 7 7 10 10 2 2

Given an array of size 100. The elements of the array are not sorted. What is the average number of comparisons needed in a sequential search to determine that the element being searched is not there?

Find the second largest element in an array with minimum no of comparisons and give the minimum no of comparisons needed on an array of size N to do the same

Find the median of two sorted arrays

In an array of integers find a pair of words which product equals to given number without using any extra space.

Given a very large array of integers, you have to find out maximum difference of any 2 elements in the array such that the larger number has got bigger index than that of smaller number.

for array [2 3 10 2 4 8 1] Ans -> 8 (10 - 2)

There are 2n+1 element in an array where n elements are repeating twice, there is only one odd element. Find out odd number `with a complexity in order 1.