Need help to optimize code

Question

Hello folks

need your valuable suggestions to improve this code performance:

https://code.sololearn.com/c54y0qiExYLM/?ref=app

Answer 1

Robin thanks for your help..

I started with same concept but could not come to conclusion for bribe count... as all positive and negative values will be equal to 0....

I got idea from explanation that 3 elevation of 2 position changes makes count as 6... how you came to know one bribe for six as seventh bribe? 4-3 and 7-6 both seems similar to me... then count should be 8 bribe...

Answer 2

wow... great Robin ... O(N^2) of this is far more better than my original code.... Just wondering whether bribe count will get affected or updated unnecessarily as you are not updating queue based on loop j just before next iteration of i....

need to check more test cases and will do this at my end... but seems what you have suggested is the better code...