Tag Archives: Java

Find Majority Element in an Array

By | | , ,
Leave a comment

Given an array of size n, Write a code to find majority element in an array.

What is Majority Element?

The majority element is the element that appears more than n/2 times where n is the size of an array.

NOTE: For this problem you can assume that the array is non-empty and the majority element always exist in the array.

Example 1:

Input : [3, 2, 3]

Output: 3

The size of the array is 3 and the element which occurs more than 1 is the majority element. So three is the output.

Example 2:

Input: [2, 2, 1, 1, 1, 2, 2]

Output: 2

The element 2 occurs more than 3 times. So, It is the majority element.

→

Remove Duplicates From Sorted Array

By | | , ,
Leave a comment

Given a sorted array, we have to write a code to remove the duplicates in-place such that each element appear only once and return the new length.

For this problem, we don’t have to use extra space. As we have to remove duplicates in-place (In O(1)).

Note that we have to return the new length, make sure to change the original array as well in place

For example:

Input : { 1, 2, 2, 3, 4, 4, 5, 6, 6, 7 }

Output: 7

Our function should return length 7 with first seven elements of array are {1, 2, 3, 4, 5, 6, 7}. It doesn’t matter what you leave beyond the returned length

→

Subarray with Given Sum

By | | , , ,
Leave a comment

Find subarray with given sum.

Given an array of unsorted integers (Positive integers), We have to write a code to find a subarray whose sum is equal to a given sum.

We have to return subarray indexes (start and end index).

For Example –

  Example 1 :

Input : arr = {10, 2, 4, 7, 5}, sum = 13

Output: {1, 3}

The numbers present from the 1st to 3rd indexes are 2, 4, 7. When we add (2 + 4 + 7) it is 13.

Example 2 :

Input : arr = {1, 4, 20, 3, 10, 5}, sum = 33

  Output: {2, 4}

Example 3 :

  Input : arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, sum = 15

   Output: {0, 4}

→