All DSA
Interview Guide

Linked Lists

0%
Coding
Theory

  • Convert Binary Number in a Linked List to Integer

    Junior

  • Find Length of Loop in Linked List

    Junior

  • Linked List Cycle

    Junior

  • Merge Two Sorted Lists

    Junior

  • Middle of the Linked List

    Junior

  • Palindrome Linked List

    Junior

  • Remove Duplicates from Sorted List II

    Junior

  • Remove Linked List Elements (Odd Values Only)

    Junior

  • Reverse Linked List

    Junior

  • Add Two Numbers in Linked Lists

    Mid

  • Convert Sorted List to Binary Search Tree

    Mid

  • Copy List with Random Pointer

    Mid

  • Delete Node in a Linked List

    Mid

  • Design LRU Cache

    Mid

  • Flatten a Multilevel Doubly Linked List

    Mid

  • Insert Node at Middle of Linked List

    Mid

  • Odd Even Linked List

    Mid

  • Remove Nth Node From End of List

    Mid

  • Reorder List

    Mid

  • Reverse Linked List II

    Mid

  • Rotate List

    Mid

  • Swap Nodes in Pairs

    Mid

  • Swapping Nodes in a Linked List

    Mid

  • Merge k Sorted Lists

    Senior

  • Reverse Nodes in k-Group

    Senior