Circular list | add at middle

Question

Can we still optimize the code to add element at middle of circular list ?

Appreciate your feedback on below code:

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

Answer 1

Maybe you could globally define a length for the list? Doing that will prevent the use of another loop to determine the bounds of the current list. You can keep track of the length by initializing a counter and incrementing/decrementimg it whenever you add/remove an item. Hopefully this helps

Answer 2

Yeah nice one... Probably making length of list as mylist class data member

Answer 3

You can also find the middle by using a classical 2 pointer approach.

You can do that by traversing the list using two pointers. Move one pointer by one and the other pointers by two ( double the speed ). When the fast pointer reaches end, slower one would already be pointing at mid.

Answer 4

Thanks Choe nd Arsenic