My Practice
search
⌘Ctrlk
My Practice
  • Introduction
  • Chapter 1 Combination and Permutation
  • Chapter 2 Binary Search & Sorted Array
  • Chapter 3 Binary Tree
  • Chapter 4 DFS & BFS
  • Chapter 5 Linked List
    • Summary 1: Pointer and update
    • Reverse Linked List
    • Iteration
    • Basic Operations
      • Problem 148: Sort List
      • Problem 19: Remove Nth Node From End of List
      • Problem 21: Merge Two Sorted Lists
      • Problem 23: Merge k Sorted Lists
      • Problem 237: Delete Node in a Linked List
      • Problem 147: Insertion Sort List
    • Find Cycles
    • Problem 234: Palindrome Linked List
  • Chapter 6 Dynamic Programming
  • Chapter 7 Graph & Search
  • Chapter 8 Data Structure
  • Chapter 9 High Frequency
  • Post Chapter 1 String
  • Post Chapter 2 Math
  • Post Chapter 3 Array
  • Facebook
  • Amazon
  • All Chapters Summary
  • Core Java Interview Questions
  • Basics of Sorting
  • Behavior Questions
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Chapter 5 Linked List

Basic Operations

Problem 148: Sort Listchevron-rightProblem 19: Remove Nth Node From End of Listchevron-rightProblem 21: Merge Two Sorted Listschevron-rightProblem 23: Merge k Sorted Listschevron-rightProblem 237: Delete Node in a Linked Listchevron-rightProblem 147: Insertion Sort Listchevron-right
PreviousProblem 328: Odd Even Linked Listchevron-leftNextProblem 148: Sort Listchevron-right

Last updated 6 years ago