[Nil]

I don't leetcode often so maybe these types of puzzles just aren't ringing my bell, but I have no clue after 10 minutes of thought what exactly is meant by reconstructing the queue. Any thoughts?

https://leetcode.com/problems/queue-reco...scription/

Edit: Came back to it later and figured it out https://sinister.ly/Thread-Legends-Recon...#pid784087
Comment if you have any questions

[OversouL]

After reading the problem. I think it meant you should order them by height. Highest being the last or vice versa. Sounds fun, but I don't have time. :L I probably forgot how to code anyway.

[Nil]

After reading the problem. I think it meant you should order them by height. Highest being the last or vice versa. Sounds fun, but I don't have time. :L I probably forgot how to code anyway.  

Not quite. If you look at the example output you can see that the height isn't the determining factor for the order.

[OversouL]

After reading the problem. I think it meant you should order them by height. Highest being the last or vice versa. Sounds fun, but I don't have time. :L I probably forgot how to code anyway.  

Not quite. If you look at the example output you can see that the height isn't the determining factor for the order.

Oh totally ignored it. XD

Perhaps the number of people in front takes priority. If number of people in front is 0 then it should be listed first. If there are more inputs with k = 0 then they are rearranged by height. But also the number of persons in front must be satisfied first. I dunno, it's kinda hard to explain.

I think I could apply the algorithms I learned from my data structures class, but I already forgot. XD

[Nil]

Well just took a break and looked at it again and realized it's fairly simple now. Implementing it isn't so simple but the gist of it is to view the front of the line as the first element. And then it's just arranging them in an order for where each item to the right's k value holds true for it's position.