This is LeetCode's official curated list of Top classic interview questions to help you land your dream job. Our top interview questions are divided into the following series:
to help you master Data Structure & Algorithms and improve your coding skills.
Just like any other skills, coding interview is one area where you can greatly improve with deliberate practice.
Most of the classic interview questions have multiple solution approaches. For the best practice result, we strongly advise you to go through this list at least a second time, or even better - a third time.
By the second attempt, you may discover some new tricks or new methods. By the third time, you should find that your code appear to be more concise compared to your first attempt. If so, congratulations!
Remember: Deliberate practice does not mean looking for answers and memorizing it. You won't go very far with that approach. The more you are able to solve a problem yourself without any reference to answers, the more you will improve.
Product of Array Except Self
Spiral Matrix
4Sum II
Container With Most Water
Game of Life
First Missing Positive
Longest Consecutive Sequence
Find the Duplicate Number
Longest Substring with At Most K Distinct Characters
Basic Calculator II
Sliding Window Maximum
Minimum Window Substring
Merge k Sorted Lists
Sort List
Copy List with Random Pointer
Word Ladder
Surrounded Regions
Lowest Common Ancestor of a Binary Tree
Binary Tree Maximum Path Sum
Friend Circles
Course Schedule
Course Schedule II
Longest Increasing Path in a Matrix
Alien Dictionary
Count of Smaller Numbers After Self
Palindrome Partitioning
Word Search II
Remove Invalid Parentheses
Wildcard Matching
Regular Expression Matching
Wiggle Sort II
Kth Smallest Element in a Sorted Matrix
Median of Two Sorted Arrays
Maximum Product Subarray
Decode Ways
Best Time to Buy and Sell Stock with Cooldown
Perfect Squares
Word Break
Word Break II
Burst Balloons
LRU Cache
Implement Trie (Prefix Tree)
Flatten Nested List Iterator
Find Median from Data Stream
Range Sum Query 2D - Mutable
Largest Number
Max Points on a Line
Queue Reconstruction by Height
Trapping Rain Water
The Skyline Problem
Largest Rectangle in Histogram
내 블로그 - 관리자 홈 전환 |
Q
Q
|
---|---|
새 글 쓰기 |
W
W
|
글 수정 (권한 있는 경우) |
E
E
|
---|---|
댓글 영역으로 이동 |
C
C
|
이 페이지의 URL 복사 |
S
S
|
---|---|
맨 위로 이동 |
T
T
|
티스토리 홈 이동 |
H
H
|
단축키 안내 |
Shift + /
⇧ + /
|
* 단축키는 한글/영문 대소문자로 이용 가능하며, 티스토리 기본 도메인에서만 동작합니다.