In problem D, how does a rotation doesn't change the parity of inversions?? Lets say we select 3 indices i, j, and k and rotate them ...i...j...k... -> ...k...i...j then order of all the elements from i to k - 1 wrt k changes..same argument can be made for i and j
@@ievoayl324 how are we making two swaps? i, j and k don't have to be adjacent...there can be elements in between, so when you do cycles, their relative position with i, j and k changes, so there are more than 2 pairs which get their order reversed
Legend is back🔥🔥
Welcome back king
Look who's back
my boy is back
Nice gonna used it as inspiration for the next Google Round
SO glad to see you back!!!
Hey Neal, I saw you have been on the Advent of Code leaderboard. Would it be possible for you to record yourself solving those problems?
Nice, i am very excited
Can you please make a video about your sublime setup ?
In problem D, how does a rotation doesn't change the parity of inversions??
Lets say we select 3 indices i, j, and k and rotate them
...i...j...k... -> ...k...i...j
then order of all the elements from i to
k - 1 wrt k changes..same argument can be made for i and j
essentially we make two swaps, and the parity of inversion change in one swap
@@ievoayl324 how are we making two swaps? i, j and k don't have to be adjacent...there can be elements in between, so when you do cycles, their relative position with i, j and k changes, so there are more than 2 pairs which get their order reversed
I love 💕 your programing Skil.
Amazing 😍😄😁
Please make a video on your linux cp setup.
Who the fuck is this lord coder
he is ridiculously fast at typing... what keyboard sounds like that btw?
Mechanical one?
idk it sounds a bit soft for mechanical maybe thats just me
impressive
what is his IDE??
Sublime
What operating system you use ?
definitely ubuntu
@@uhhuhhoney3997 thenk you