https://github.com/dreamoftheredchamber/leetcode

https://github.com/dreamoftheredchamber/leetcode

interview leetcode

Last synced: 5 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/dreamoftheredchamber/leetcode
• Owner: DreamOfTheRedChamber
• Created: 2016-08-02T05:17:36.000Z (over 8 years ago)
• Default Branch: master
• Last Pushed: 2024-06-18T01:36:58.000Z (8 months ago)
• Last Synced: 2025-01-20T17:13:22.292Z (12 days ago)
• Topics: interview, leetcode
• Language: Python
• Homepage: https://eric-zhang-seattle.gitbook.io/leetcode-1/
• Size: 73.7 MB
• Stars: 254
• Watchers: 23
• Forks: 95
• Open Issues: 7
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
- [README](#readme)

  - [Methodology](#methodology)

    - [Categorize question types](#categorize-question-types)

    - [Learn from answers and train my thoughts](#learn-from-answers-and-train-my-thoughts)

    - [Practice with "Explain Everything"](#practice-with-explain-everything)

  - [Readability](#readability)

- [Task lists](#task-lists)

  - [Parenthesis](#parenthesis)

  - [Dynamic programming](#dynamic-programming)

  - [Design](#design)

  - [Other](#other)

  - [Binary search](#binary-search)

  - [Greedy](#greedy)

# README

## Methodology

### Categorize question types

### Learn from answers and train my thoughts 

### Practice with "Explain Everything"

## Readability 

* Gitbook serves as a nice representation engine for this repo. 

* You could see it at https://eric-zhang-seattle.gitbook.io/leetcode-1/

# Task lists

## Parenthesis

1. 1249. Minimum Remove to Make Valid Parentheses

2. 921. Minimum Add to Make Parentheses Valid

3. 301. Remove invalid parentheses

## Dynamic programming

1. 629. K Inverse Pairs Array

2. 1235. Maximum Profit in Job Scheduling

3. 1420. Build Array Where You Can Find The Maximum Exactly K Comparisons

4. 1531. String Compression II

5. 2742. Painting the walls

6. 2851. String Transformation

7. 1458. Max Dot Product of Two Subsequences

8. 1611. Minimum One Bit Operations to Make Integers Zero

## Design

1. 380. Insert Delete GetRandom O(1)

2. 381. Insert-Delete-GetRandom-O1-Duplicates-allowed

3. 362. Design Hit Counter

4. 2296. Design a Text Editor

5. 2043. Simple Bank System

## Other

1. 1291. Sequential Digits (M)

## Binary search

1. 2468. Split Message Based on Limit (H)

## Greedy

1. 2870. Minimum Number of Operations to Make Array Empty