Scribd
Upload
2 views2 pages

Array Problems and Solutions Guide

The document provides a list of algorithms and techniques for various array manipulation problems, including finding pairs with a given sum, checking for subarrays with zero sum, and sorting binary arrays in linear time. It also covers methods for merging sorted arrays, rearranging elements based on specific conditions, and finding missing elements in sorted and unsorted arrays. Each topic is linked to a detailed explanation on Techie Delight's website.

Uploaded by

almahamudrohitjim
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

Array Problems and Solutions Guide

The document provides a list of algorithms and techniques for various array manipulation problems, including finding pairs with a given sum, checking for subarrays with zero sum, and sorting binary arrays in linear time. It also covers methods for merging sorted arrays, rearranging elements based on specific conditions, and finding missing elements in sorted and unsorted arrays. Each topic is linked to a detailed explanation on Techie Delight's website.

Uploaded by

almahamudrohitjim
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Find a pair with the given sum in an array

[Link]

Check if a subarray with 0 sum exists or not


[Link]

Sort binary array in linear time


[Link]

Find maximum length subarray having a given sum


[Link]

In-place merge two sorted arrays


[Link]

Merge two arrays by satisfying given constraints


[Link]

Move all zeros present in an array to the end


[Link]

Rearrange an array with alternate high and low elements


[Link]

Rearrange an array such that it contains alternate positive and negative numbers
[Link]

Rearrange array such that `A[A[i]]` is set to `i` for every element `A[i]`
[Link]

Segregate positive and negative integers in linear time


[Link]

Merge two sorted arrays


[Link]

Merge two sorted arrays from their end


[Link]

Binary Search Algorithm


[Link]

Find the first or last occurrence of a given number in a sorted array


[Link]

Find the smallest missing element from a sorted array


[Link]
Find the smallest missing positive number from an unsorted array
[Link]

Find floor and ceil of a number in a sorted integer array


[Link]

Find the missing term in a sequence in logarithmic time


[Link]

Efficiently sort an array with many duplicated values


[Link]

Shrink an array by removing triplets that satisfy given constraints


[Link]

Reverse an array in C++


[Link]

Replace every array element with the least greater element on its right
[Link]

You might also like