Python Algorithms Traing Basic
latest
  • chapter 1: Array
    • Array - Easy
    • Array - Easy 2
    • Array - Medium
    • Array - Hard
  • chapter 2: Backtracking
  • chapter 3: Binary Search
  • chapter 4: Bit manipulation
  • chapter 5: Breadth First Search
  • chapter 6: Combination
  • chapter 7: Depth First Search
  • chapter 8: DFA
  • chapter 9: DivideConquer
  • chapter 10: Dynamic Programming
  • chapter 11: Graph
  • chapter 12: Greedy
  • chapter 13: Hash table
  • chapter 14: Heap
  • chapter 15: Linked List
  • chapter 16: Math
  • chapter 17: Others
  • chapter 18: Recursion
  • chapter 19: Stack
  • chapter 20: String
  • chapter 21: ToBeOptimized
  • chapter 22: Tree
  • chapter 23: Two Pointers
Python Algorithms Traing Basic
  • Docs »
  • chapter 1: Array
  • Edit on GitHub

chapter 1: Array¶

  • Array - Easy
    • 1.Two Sum
    • 27.Remove Element
    • 35.Search Insert Position
    • 53.Maximum Subarray
    • 66.Plus One
    • 88. Merge Sorted Array
    • 88.2 Merge Sorted Array 2
    • 118. Pascal's Triangle
    • 118.2 Pascal's Triangle
    • 118.3 Pascal's Triangle 3
    • 119. Pascal's Triangle 2
    • 121. Best Time to Buy and Sell Stock
    • 122. Best Time to Buy and Sell Stock 2
    • 167. Two Sum 2
    • 169. Majority Element
    • 189. Rotate Array
    • 217. Contains Duplicate
    • 219. Contains Duplicate 2
    • 268. Missing Number
    • 283. Move Zeroes
    • 414. Third Maximum Number
    • 448. Find All Numbers Disappeared in Array
    • 485. Max Consecutive Ones
    • 532. K-diff Pairs in an Array
    • 561. Array Partition 1
    • 566. Reshape the Matrix
    • 581. Shortest Unsorted Continuous Subarray
  • Array - Easy 2
    • 31. Next Permutation
    • 41. First Missing Positive
    • 54. Spiral Matrix
    • 56. Merge Intervals
    • 57. Insert Intervals
    • 59. Spiral Matrix 2
    • 73. Set Matrix Zeroes
  • Array - Medium
  • Array - Hard
Next Previous

© Copyright 2019, sean Revision 21c49f22.

Built with Sphinx using a theme provided by Read the Docs.