Two sum: Difference between revisions

Content added Content deleted

Inline

Revision as of 15:50, 5 December 2017 (view source) Nigel Galloway (talk \| contribs) (→‎{{header\|F_Sharp\|F#}}) ← Older edit		Revision as of 17:46, 5 December 2017 (view source) Eoraptor (talk \| contribs) mNo edit summary Newer edit →
Line 2:		Line 2:

	;Task		;Task
	Given a sorted array of integers, is it possible to find a pair of integers from that array that sum up to a given sum? If so, return indices of the two integers or an empty array if not. The solution is not necessarily unique.		Given a sorted array of integers (with possible duplicates), is it possible to find a pair of integers from that array that sum up to a given sum? If so, return indices of the two integers or an empty array if not. The solution is not necessarily unique.