Minimum Number of Moves to Seat Everyone - Leetcode 2037 - Python 

The way this question was worded made it hard to understand.

Man finds counting sort hammer. Processed to see counting sort nails.

Thanks for the different approaches.

thank you for different solutions!

1. Sort both array. 2. Add abs different of same index value.

i literally had no idea what they were asking in this question….once nice thing in interviews is that at least you can ask clarifying questions

considering array is small sorting is sweet and simple approach. Counting sort can be discussed if interviewer ask for more optimised approach.

Following you since last 4 month with 95 percent consistency

This week , Leetcode has made us to count numbers 👏👏

thanks man i've been doing the daily Q for the last few weeks and it's always good to double check against your solutions

This is an example of how to make an easy question confusing. Neet's explanation is good. But how is this question presented? It makes it confusing. Also, about the constraints. How I look at it is; students and seats are less than or equal 100 but not less than 1. Does that mean the. Max # you can iterate is 100? The number of items in each array doesn't matter? But both must not be greater than 100 or less than 1. Example if seats [1~100] and students [1~100] then the moves will be 0? Because every students have every seat?

yeah i came up with both solutions and was confused why the regular sorting was consistently faster then couting sort

You are doing god's work. I can't describe to you how much your videos have helped me in learning algorithms. I will forever be grateful!

If you consider space complexity, nlogn solution would be preferable

I really liked the way, you explained about the need of those sort methods A.K.A Rant 😂

When the n is small, nlogn and n tend to be the quite the same. That is why sorting is better in this case.

Nice 🎉

honestly can't say trying counting sort is meaningful in this problem. but it was a great example to show big-O is not always correct measure

My solution seats = sorted(seats) students = sorted(students) res = 0 for i in range(len(students)): res += abs(seats[i] - students[i]) return res

This question was so weirdly worded. Meanwhile a trivial solution is to find the difference between the sums of the arrays. It did solve 53 testcases for me 😅😂😂😂😂

Big Fan of your work here but I have one suggestion if you could give a formal proof for how the solutions works for questions like these it wud be excellent I dont think most people dont cover it nonetheless it is quite important too.

I just cam r to understand this question.

Sort both array SUM += diff from i to n indices did the trick AM I WRONG FROM DOING LIKE THIS

Seems like internship season started in leetcode. 😅

Log100 is supposed to be 2 right?

Bro leetcode problem no 481 try

never try to relate real-world problems with dsa

Bro

2:22 lmao erase that one real quick

The solution is not clear or convincing