← Back to TCS

Linked List

TCS NQT Prep • 28 items

1Palindrome Linked ListEasy

Linked ListTwo PointersStack

2Palindrome Linked ListEasy

Linked ListTwo PointersStack

3Add Two NumbersMedium

Linked ListMathRecursion

4Palindrome Linked ListEasy

Linked ListTwo PointersStack

5Middle of the Linked ListEasy

Linked ListTwo Pointers

6Remove Nth Node From End of ListMedium

Linked ListTwo Pointers

7Add Two NumbersMedium

Linked ListMathRecursion

8Merge k Sorted ListsHard

Linked ListDivide and ConquerHeap (Priority Queue)

9Delete the Middle Node of a Linked ListMedium

Linked ListTwo Pointers

10Merge Two Sorted ListsEasy

Linked ListRecursion

11Reverse Linked ListEasy

Linked ListRecursion

12Convert Sorted List to Binary Search TreeMedium

Linked ListDivide and ConquerTree

13Odd Even Linked ListMedium

Linked List

14Remove Duplicates from Sorted ListEasy

Linked List

15Reorder ListMedium

Linked ListTwo PointersStack

16Add Two NumbersMedium

Linked ListMathRecursion

17Remove Nth Node From End of ListMedium

Linked ListTwo Pointers

18Middle of the Linked ListEasy

Linked ListTwo Pointers

19Merge Two Sorted ListsEasy

Linked ListRecursion

20Merge k Sorted ListsHard

Linked ListDivide and ConquerHeap (Priority Queue)

21Delete the Middle Node of a Linked ListMedium

Linked ListTwo Pointers

22Remove Duplicates from Sorted ListEasy

Linked List

23Palindrome Linked ListEasy

Linked ListTwo PointersStack

24Reverse Linked ListEasy

Linked ListRecursion

25Odd Even Linked ListMedium

Linked List

26Convert Sorted List to Binary Search TreeMedium

Linked ListDivide and ConquerTree

27Reorder ListMedium

Linked ListTwo PointersStack

28Swap Nodes in PairsMedium

Linked ListRecursion