Palindromic linked list interview bit

#1

i am giving you a modular code of palindromic linked list problem of interview bit …i think my code’s time complexity is order of n…please tell me am i right or not …and if not please tell me the right time complexity of my code

#2

share code in cb ide

#3
#4

yes it is O( N ) time complexity

#5

ohk thanks …i don’t know why interview bit is not considering it as order of n…any way thanks

1 Like