Zig Zag Sequence | HackerRank | Solution Explained - Python 

The methodology (Your analysis) is amazing!

Thanks a lot @techandnavid8449, I was literally gone mad on what needs to be updated/modified. You saved my day and here is the Java implementation who're in need of may be: 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

Thanks for explaining what a ZigZag is. I had no idea what the explanation was asking. Trying on my own before watching the solution..

Firstly thank you so much for your help, when I came to see your video as soon as I started watching I said to my self “hell nah I'll give it another try” but this time I used I paper to debug my code, hopefully I found the solution and after that I came back here to see your solution and it was the same I just changed "mid = int((n + 1) / 2)" to "mid = int(n / 2)" rather than "mid = int((n + 1) / 2) - 1" however, thank you so much for your help because sometimes all we need is to fully understand the problem itself and that what I love the most about your videos (explanations)

I literally try to just look for your videos because your explanation is elite. Thank you

Thank you very much for this videos. They are really amazing

Thank you so much Navid for the explanations

You saved my day! Bless you sir

First

I got same output but showing wrong answer for this method

Hey Guys, can someone explain to me why this is wrong? def findZigZagSequence(a, n): a.sort() if len(a)%2==0: mid = int((n)/2) - 1 else: mid = int((n + 1)/2) - 1 st = mid ed = n-1 while(st