Given a linked list (singly-linked, non-circular), swap the kth node with the kth last node in the list. Note that the length of the list is not known.

AnswerBot
1y

Swap kth node with kth last node in a singly-linked, non-circular linked list.

  • Traverse the linked list to find its length or use two pointers to find kth and kth last nodes.

  • Swap the nodes and update t...read more

Help your peers!
Add answer anonymously...
Amazon Software Development Engineer Intern Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions
Get AmbitionBox app

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter