Skip to the selected question
ASIC.FYI

ASIC Question Bank

1,000+ hardware interview questions
Question bank1110 results
  1. Easy
  2. Easy
  3. Medium
  4. Medium
  5. Medium
  6. Medium
  7. Easy
  8. Easy
  9. Easy
  10. Easy
  11. Easy
  12. Easy
  13. Easy
  14. Easy
  15. Medium
  16. Easy
  17. Medium
  18. Easy
  19. Hard
  20. Medium
  21. Medium
  22. Easy
  23. Medium
  24. Medium
  25. Medium
  26. Easy
  27. Medium
  28. Medium
  29. Easy
  30. Easy
  31. Medium
  32. Medium
  33. Hard
  34. Easy
  35. Medium
  36. Hard
  37. Easy
  38. Medium
  39. Hard
  40. Medium
  41. Medium
  42. Easy
  43. Medium
  44. Medium
  45. Medium
  46. Easy
  47. Hard
  48. Easy
  49. Easy
  50. Easy
DescriptionQ236
Page ↗
Q236FWASIC interview problem

Remove the nth node from the end

TechniquesLinked listTwo pointers
DifficultyMedium
TopicLinked Lists
LanguageSystemVerilog
Requirements3 checkpoints
01

Problem

Remove the nth node from the end of a singly linked list in one traversal and return the head.

Example input and output

Use this case to check your interpretation
Input
head = 1 -> 2 -> 3 -> 4 -> 5, n = 2
Output
1 -> 2 -> 3 -> 5
Explanation

Keeping the lead pointer two nodes ahead places the trailing pointer immediately before node 4.

02

Requirements (3)

  • Treat n as one-based from the tail.
  • Leave the list unchanged when n is not positive or exceeds the list length.
  • Correctly remove the head when n equals the list length.