🌃
Limited Algorithm
search
⌘Ctrlk
🌃
Limited Algorithm
  • Summary
  • Hash & TreeMap
  • Queue &Stack & PQ
  • Hybrid Data Structure
  • Graph
  • Graph Backtracking and Others
  • Tree
  • Pure Recursion & Backtracking
  • Dynamic Programming
  • Others
  • Array& LinkedList & String
    • String & Character& StringBuilder
    • Array/List & LinkedList
    • Integer Class
    • Practice 0 Basic Operation & Implement
    • Practice 1 String & LinkedList
      • Problem 1 Add Binary
      • Problem 2 Plus One
      • Problem 3 Add Strings
      • Problem 4 Add Two Numbers
      • Problem 5 Add Two Numbers
      • Problem 6 Plus One Linked List
      • Problem 7 Add two Polynomial
      • Problem 8 Remove Linked List
      • Problem 9 Delete Linked List
      • Problem 10
      • Problem 11
    • Practice 2 LinkedList & String
    • Practice 3 LinkedList & Array
    • Practice 4 Integer, String and Pointers Practice
    • Practice 5 Advance String Practice I
    • KMP
    • Practice X Matrix Rotation
  • Adavance Two Pointer
  • Advance Sliding Window
  • Advance Binary Search
  • Advance Young's Matrix
  • Java Knowledge
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Array& LinkedList & String

Practice 1 String & LinkedList

5 LinkedList & String& Array I

Add Binaryarrow-up-right

Plus Onearrow-up-right

Add Stringsarrow-up-right

Add Two Numbersarrow-up-right

Add Two Numbers IIarrow-up-right

Plus One Linked Listarrow-up-right

Add Two Polynomials Represented as Linked Listsarrow-up-right

Remove Linked List Elementsarrow-up-right

Delete Node in a Linked Listarrow-up-right

Delete the Middle Node of a Linked Listarrow-up-right

Remove Nth Node From End of Listarrow-up-right

PreviousLinkedList Designchevron-leftNextProblem 1 Add Binarychevron-right

Last updated 2 years ago