CodeGeek Venturesity Programming Club

Drifting that mario kart straight to 28! ✨🍾

Here's the first one,

Given a rotated sorted array, find the first occurrence of a certain number X with the lowest possible complexity(both time and space).

X = 6
Arr = 8,9,9,1,3,4,4,4,6,6,7,7

Asked in Amazon SDE interview. Leave your answers in the comments below along with an explanation. :)

Hello everyone!
We've been on a hold since a long time and we're going to start a chain of some algorithm questions to keep your minds boggling.

Hope everyone has a good time solving them. :D