We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Circular Array Rotation
  5. Discussions

Circular Array Rotation

Sort by

recency

|

3103 Discussions

|

  • davidsawyer
     + 0 comments

    in scala without actually rotating

    def circularArrayRotation(a: Array[Int], k: Int, queries: Array[Int]): Array[Int] = {
  val kMod = k % a.length
  queries.map(x => a(if ((x - kMod + a.length) > 0) (x - kMod + a.length) % a.length else 0))
}

  • awadallayossef
     + 0 comments
    def circularArrayRotation(a:list, k:int, queries:list):
    ### Shift Circulate 
    result = []
    for x in range(k):
        last = a[-1]
        a.insert(0,last)
        a.pop(-1)
    
    ### add numbers to result based on queary
    for num in queries:
        result.append( a[num])
    return result

  • giriprasath_0508
     + 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]

  • yashdeora98294
     + 0 comments

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

  • raveen_re
     + 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;