Package com.sl.algorithms.search.pigeonhole

If 'n' items are put into 'm' containers (m is less than n), then at least one container must contain more than 1 item.

For example, there must be at least two left gloves or two right gloves in a group of three gloves.

Reference 1
Reference 2

See: Description

Class Summary

Class	Description
AuxSpaceDupFinder
ConstantSpaceDupFinder	Reference Crux: Position of the node with multiple incoming pointers is the duplicate. Assumption: There is at least one duplicate in the list. Complexity: O(n) time, O(1) space
LinearTimeMNFinder	O(n) time and O(1) space algorithm to find the first missing positive number.

Package com.sl.algorithms.search.pigeonhole Description

If 'n' items are put into 'm' containers (m is less than n), then at least one container must contain more than 1 item.

For example, there must be at least two left gloves or two right gloves in a group of three gloves.

Reference 1
Reference 2