Zig Zag Sequence

Sort by

recency

|

139 Discussions

|

  • + 0 comments

    I found the correct code for java. I was struggling as everyone here, and understood that we should not right the code to solve the problem, we only need to change the given code to get the correct output.

    import java.util.*;
    import java.lang.*;
    import java.io.*;
    import java.math.*;
    public class Main {
        
        public static void main (String[] args) throws java.lang.Exception {
            Scanner kb = new Scanner(System.in);
            int test_cases = kb.nextInt();
            for(int cs = 1; cs <= test_cases; cs++){
                int n = kb.nextInt();
                 int a[] = new int[n];
                for(int i = 0; i < n; i++){
                    a[i] = kb.nextInt();
                }
                findZigZagSequence(a, n);
            }
       }
       
        public static void findZigZagSequence(int [] a, int n){
            Arrays.sort(a);
            int mid = n /2; //first change
            int temp = a[mid];
            a[mid] = a[n - 1];
            a[n - 1] = temp;
        
            int st = mid + 1;
            int ed = n - 2; //second change
            while(st <= ed){
                temp = a[st];
                a[st] = a[ed];
                a[ed] = temp;
                st = st + 1;
                ed = ed - 1; //third change
            }
            for(int i = 0; i < n; i++){
                if(i > 0) System.out.print(" ");
                System.out.print(a[i]);
            }
            System.out.println();
        }
    }
    
  • + 1 comment

    I am using pyhon. I believe my solution is right. I only change 3 lines of code. Still I can't get this to work.

  • + 0 comments

    Mine was broken like some of the other comments here, and it was due to changing too many lines. Even though I changed and undid my change it wasn't until after I hit the "reset code" button in the top right and then applied my 3 lines of changes that my solution was accepted.

  • + 0 comments

    The return void problems like this are always broken

  • + 0 comments

    There is no code to debug in Javascript but I try to get the result in 3 lines but it did not pass the test.

    function processData(input) { //Enter your code here const arr = input.split('\n')[2].split(' ').map(str => parseInt(str)).sort((a,b) => a - b); const mid = Math.floor(arr.length/2); console.log([...arr.slice(0,mid),...arr.slice(mid).reverse()].map(String).join(" "));

    }