Skip to content

Latest commit

 

History

History
172 lines (134 loc) · 4.33 KB

README.md

File metadata and controls

172 lines (134 loc) · 4.33 KB
Raw

Meta-LeetcodeJS

You can find me in Leetcode at https://leetcode.cn/u/lesenelir/

JavaScript solutions for Personal Leetcode problems

The contents of this repository including:

Learning JavaScript Data Structure & Algorithm Book

Coding Interviews Book

Personal Leetcode problems

Data Structure & Algorithm Classification

  • Data Structure

    • Array
    • Linked List
    • Doubly Linked list
    • Queue
    • Stack
    • Hash table
    • Heap - Max Heap & Min Heap
    • Priority Queue
    • Dictionary Tree
    • Tree
    • Graph

  • Algorithm

    • Sort
    • Search
    • Math
    • String
    • Simulation
    • Greedy Algorithm
    • Recursion
    • Dynamic Programming (DP)
    • Depth-First-Search （DFS）
    • Breadth First Search (BFS)

Leetcode Problems Label

  • Hash Table

    • 0001
    • CI03

  • Two Pointers - Fast & Slow Pointers

    • 0026
    • 0080
    • CI21
    • CI22
    • CI39

  • Two Pointers - Begin & End Pointers

    • CI21

  • Binary Search

    • 0033
    • 0035
    • 0081
    • 0004
    • CI11

  • Search Number

    • CI04 (Two Dimension Array)

  • Math

    • CI15
    • CI17

  • Merge Sort

    • 0004

  • String

    • CI05

  • Linked List

    • CI06
    • CI18
    • CI22
    • CI24
    • CI25

  • Binary Tree

    • CI07
    • CI26
    • CI27
    • CI28

  • Stack

    • CI09
    • CI30
    • CI31

  • Recursion

    • CI16
    • CI24
    • CI25
    • CI26
    • CI27
    • CI28

  • Dynamic Programming (DP)

    • CI10
    • CI10-II
    • CI14

  • Greedy Algorithm

    • CI14-II

  • Depth-First-Search (DFS)

    • CI12

  • Breadth First Search (BFS)

    • CI13

  • Simulation

    • CI29

Leetcode Personal AC Order & Coding Interviews AC Order

  • 0000 Prepare for JS Leetcode

  • 0001 two-sum.js           (Hash Table)

  • 0026 Remove-Duplicates-from-Sorted-Array.js           (Two Pointers -- Fast & Slow Pointers)

  • 0080 Remove-Duplicates-from-Sorted-Array-II.js           (Two Pointers -- Fast & Slow Pointers)

  • 0035 Search-Insert-Position.js           (Binary Search)

  • 0033 Search-in-Rotated-Sorted-Array.js           (Binary Search)

  • 0081 Search-in-Rotated-Sorted-Array-II.js           (Binary Search)

  • 0004 Median-of-Two-Sorted-Arrays.js           (Binary search - Merge Sort)

  • Code Interviews 03           (Hash Table)

  • Code Interviews 04           (Two Dimension Array -- Search Number)

  • Code Interviews 05           (String)

  • Code Interviews 06           (Linked List)

  • Code Interviews 07           (Binary Tree)

  • Code Interviews 09           (Stack)

  • Code Interviews 10           (Dynamic Programming)

  • Code Interviews 10-II           (Dynamic Programming)

  • Code Interviews 11           (Binary Search)

  • Code Interviews 12           (Depth-First-Search)

  • Code Interviews 13           (Depth-First-Search)

  • Code Interviews 14           (Dynamic Programming)

  • Code Interviews 14-II           (Greedy Algorithm)

  • Code Interviews 15           (Math)

  • Code Interviews 16           (Recursion)

  • Code Interviews 17           (Math)

  • Code Interviews 18           (Linked List)

  • Code Interviews 21           (Two Pointers)

  • Code Interviews 22           (Linked List & Two Pointers)

  • Code Interviews 24           (Linked List & Recursion)

  • Code Interviews 25           (Linked List & Recursion)

  • Code Interviews 26           (Binary Tree & Recursion)

  • Code Interviews 27           (Binary Tree & Recursion)

  • Code Interviews 28           (Binary Tree & Recursion)

  • Code Interviews 29           (Simulation)

  • Code Interviews 30           (Stack)

  • Code Interviews 31           (Stack)

  • Code Interviews 39           (Array & Two Pointers)