[LeetCode] Top Interview Questions - Medium Collection
소개 Introduction
이것은 LeetCode의 공식 큐레이팅 된 Top 클래식 인터뷰 질문 목록입니다. 우리의 주요 인터뷰 질문은 당신의 데이터 구조 및 알고리즘을 마스터하고 코딩 기술 향상을 위해 다음 시리즈로 나뉩니다.
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.
다른 기술과 마찬가지로 코딩 인터뷰는 신중한 연습을 통해 크게 향상시킬 수있는 영역 중 하나입니다 .
대부분의 고전적인 면접 질문에는 여러 솔루션 접근 방식이 있습니다. 모범 사례 결과를 얻으려면이 목록을 적어도 두 번째 또는 더 나은 세 번째로 검토 하는 것이 좋습니다 .
두 번째 시도로 새로운 트릭이나 새로운 방법을 발견 할 수 있습니다. 세 번째로 코드가 첫 번째 시도에 비해 더 간결한 것처럼 보일 것입니다. 그렇다면 축하합니다!
기억하십시오 : 고의적 인 연습은 답을 찾고 암기하는 것을 의미하지 않습니다. 당신은 그 접근 방식으로 멀리 가지 않을 것입니다. 답을 참조하지 않고 스스로 문제를 해결할 수있을수록 더 향상 될 것입니다.
Array and Strings
3Sum
Set Matrix Zeroes
Group Anagrams
Longest Substring Without Repeating Characters
Longest Palindromic Substring
Increasing Triplet Subsequence
Missing Ranges
Linked List
Add Two Numbers
Odd Even Linked List
Intersection of Two Linked Lists
Trees and Graphs
Binary Tree Inorder Traversal
Binary Tree Zigzag Level Order Traversal
Construct Binary Tree from Preorder and Inorder Traversal
Populating Next Right Pointers in Each Node
Kth Smallest Element in a BST
Inorder Successor in BST
Number of Islands
Backtracking
Letter Combinations of a Phone Number
Generate Parentheses
Permutations
Subsets
Word Search
Sorting and Searching
Sort Colors
Top K Frequent Elements
Kth Largest Element in an Array
Find Peak Element
Search for a Range
Merge Intervals
Search in Rotated Sorted Array
Meeting Rooms II
Search a 2D Matrix II
Dynamic Programming
Jump Game
Unique Paths
Coin Change
Longest Increasing Subsequence
Design
Flatten 2D Vector
Serialize and Deserialize Binary Tree
Insert Delete GetRandom O(1)
Design Tic-Tac-Toe
Math
Happy Number
Factorial Trailing Zeroes
Excel Sheet Column Number
Pow(x, n)
Sqrt(x)
Divide Two Integers
Fraction to Recurring Decimal
Others
Sum of Two Integers
Evaluate Reverse Polish Notation
Majority Element
Find the Celebrity
Task Scheduler
.
Array and Strings - Top Interview Questions[Medium] (1/9)
Linked List - Top Interview Questions[Medium] (2/9) : Java
Trees and Graphs - Top Interview Questions[Medium] (3/9) : Java
Backtracking - Top Interview Questions[Medium] (4/9) : Java
Sorting and Searching - Top Interview Questions[Medium] (5/9) : Java
Dynamic Programming - Top Interview Questions[Medium] (6/9) : Java
Design - Top Interview Questions[Medium] (7/9) : Java
.
Array and Strings - Top Interview Questions[Medium] (1/9) : Python
Linked List - Top Interview Questions[Medium] (2/9) : Python
Trees and Graphs - Top Interview Questions[Medium] (3/9) : Python
Backtracking - Top Interview Questions[Medium] (4/9) : Python
Sorting and Searching - Top Interview Questions[Medium] (5/9) : Python
Dynamic Programming - Top Interview Questions[Medium] (6/9) : Python
Design - Top Interview Questions[Medium] (7/9) : Python
