Code Monkey home page Code Monkey logo

pepco's Introduction

pepco's People

Contributors

abhishekmishra1016 avatar alwaysactivo avatar amanagarwal0702 avatar ayushig2610 avatar coderelay2020 avatar const-ntino avatar deepalirathi avatar dhruvtrehan avatar divyanshnigam avatar dnigam1 avatar exceptiionchan avatar hemant2705 avatar imyogeshgaur avatar khushboo683 avatar kvaishvik24 avatar luciferarm avatar mdanassid2254 avatar mdshahansha avatar nisha1910 avatar piyush-kash avatar preetesh21 avatar priyen1912 avatar pseudo-hacker avatar rahulbarad avatar raichu-007 avatar sahilrawat001 avatar sanjanasingh31 avatar user-akj avatar vermavinay8948 avatar yashtikakakkar avatar

Stargazers

avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar

Watchers

avatar

Forkers

dhruvtrehan daggerhub dnigam1 divyaagrawal2301 alwaysactivo raichu-007 eddges kvaishvik24 coderelay2020 bhavsarcoders exceptiionchan gwynbledid jaishree-19 npav5057 piyush-kash imyogeshgaur luciferarm mansilad priyam03-code priyen1912 sanjanasingh31 aditinigam kashish888 rahulbarad rathodbhakti akhil-s-babu user-akj abhishekmishra1016 codenitros subrata21 sauravb10 amitagoel archiita krupanagar pseudo-hacker shubh-1612 mdshahansha satyamsihare taayush chandresh189189189 n140191 mohdfaadhil deepalirathi amanagarwal0702 khushboo683 ayushig2610 ayushsingh243 33hm anshul123kumar vermavinay8948 anukriti-2708 shalini-16 mdanassid2254 jaya7791 nisha1910 sahilrawat001 devedu-ai

pepco's Issues

Search in a rotated sorted array in c++

There is an integer array nums sorted in ascending order (with distinct values).

Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed). For example, [0,1,2,4,5,6,7] might be rotated at pivot index 3 and become [4,5,6,7,0,1,2].

Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.

You must write an algorithm with O(log n) runtime complexity.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.