← Back to Accenture

Linked List

10 questions

1Merge Two Sorted ListsEasy
Linked ListRecursion
Solve →
2Add Two NumbersMedium
Linked ListMathRecursion
Solve →
3Middle of the Linked ListEasy
Linked ListTwo Pointers
Solve →
4Remove Nth Node From End of ListMedium
Linked ListTwo Pointers
Solve →
5Reverse Linked ListEasy
Linked ListRecursion
Solve →
6Middle of the Linked ListEasy
Linked ListTwo Pointers
Solve →
7Remove Nth Node From End of ListMedium
Linked ListTwo Pointers
Solve →
8Add Two NumbersMedium
Linked ListMathRecursion
Solve →
9Merge Two Sorted ListsEasy
Linked ListRecursion
Solve →
10Reverse Linked ListEasy
Linked ListRecursion
Solve →