Sort by

recency

|

3101 Discussions

|

  • + 0 comments
    def circularArrayRotation(a, k, queries):
        for _ in range(k):
            k=a.pop()
            a.insert(0,k)
        return [a[i] for i in queries]
    
  • + 0 comments

    Here is problem solution in Python, Java, C++, C and Javascript - https://programmingoneonone.com/hackerrank-circular-array-rotation-problem-solution.html

  • + 1 comment

    TS solution

        let n = k % a.length;
         
        let temp1 = a.slice(a.length-(n), a.length);
        let temp2 = a.slice(0, a.length-(n));
            
        a = [...temp1, ...temp2]
        
        let newArr: number[] = [];
        queries.map((num)=>{
            newArr.push(a[num]);
        })
        return newArr;
    
  • + 0 comments

    In python, O(q) return [a[(len(a)-k+i)% len(a)] for i in queries]

  • + 0 comments

    Here is problem solution in Python, Java, C++, C and Javascript - https://programmingoneonone.com/hackerrank-circular-array-rotation-problem-solution.html