Sort by

recency

|

2212 Discussions

|

  • + 0 comments

    def reverseArray(a): # Write your code here return list(reversed(a));

  • + 0 comments

    a.reverse() return a

  • + 0 comments

    def reverseArray(a): left = 0 right = len(a)-1

            while right > left:
                        a[left], a[right] = a[right],a[left]
                        left += 1
                        right -= 1
    

    return a

  • + 0 comments
    function reverseArray(a: number[]): number[] {
        const n = a.length;
        for(let i = 0; i < n / 2; i++) {
            const temp = a[i];
            a[i] = a[n - 1 - i];
            a[n - 1 - i] = temp;
        }
        return a;
    }
    
  • + 0 comments
    public static List<Integer> reverseArray(List<Integer> a) {
    // Write your code here
    List<Integer> reversed = new ArrayList<>();
    for (int i = a.size() - 1; i >= 0; i--) {
        reversed.add(a.get(i));
    }
    return reversed;
    

    }