Check if there is a pair with a given sum in a sorted rotated array | Array Rotations - 6

preview_player
Показать описание
We are given a sorted-rotated array and a sum (say x), and we have to check if there exists a pair of elements in the array whose sum is same as x.

Problem Link:

Link to related video:

#arrayrotation #gfg #codesplaining
Рекомендации по теме
Комментарии
Автор

Thank you, sir, for this informative video.

aadarshpandey
Автор

Sir please add more videos, your explanations strategies are good..

sakshimaurya
visit shbcf.ru