Open DishankJha opened 2 weeks ago
I want to work on this could you please assign me?
@strivedi4u please add labels of hacktoberfest
@strivedi4u i wanna work on this could you please assign this task to me will solve with proper explaination
@strivedi4u sir, please assign me the proper link since the link's aren't working
assign me
@rahul-chakradhari , the issue was created by @DishankJha . Please contact him for further details.
🚀 Follow me, 💬 Join the WhatsApp Group, and ⭐ Star the Repo to support our journey together!
Background: You are working on a search algorithm for a dataset that is stored in a rotated sorted array. This type of array can often be encountered in scenarios where data is initially sorted but then shifted due to certain operations. For example, consider a circular queue or a dataset that is sorted based on timestamps and is subject to periodic updates.
Problem Statement: You are given a rotated sorted array nums consisting of n unique integers. The array is sorted in ascending order before the rotation. Your task is to design a function that searches for a target value in the array. If the target exists, return its index; if it does not exist, return -1.
Please assign me this issue. Also , add labels of hacktoberfest.