All Questions
2
questions
2
votes
1
answer
182
views
Sit N people around a table so as to minimize the maximum difference in height between any two adjacent people
(This is actually a coding challenge for an interview. Unfortunately, only 2 test cases are coded, so even if my solution passes them both, that doesn't tell me I've found the correct solution. Also, ...
- 315
1
vote
1
answer
713
views
Minimum number of moves to create a new permutation
Edit: Before you begin, please note that a move refers to swapping a pair of letters (thanks to ferfer93)
Ok, so I understand the title is a bit ambiguous, so I'll clarify it further below:
Let us ...
