Problem Solving with Algorithms

반응형

Introduction

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:

이것은 LeetCode의 공식 큐레이팅 된 Top 클래식 인터뷰 질문 목록입니다. 우리의 주요 인터뷰 질문은 다음 시리즈로 나뉩니다.

  1. Easy Collection
  2. Medium Collection
  3. Hard Collection

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

 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

 

 

Linked List

 Merge k Sorted Lists

 Sort List

 Copy List with Random Pointer

 

 

Trees and Graphs

 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

 

 

Backtracking

 Palindrome Partitioning

 Word Search II

 Remove Invalid Parentheses

 Wildcard Matching

 Regular Expression Matching

 

 

Sorting and Searching

 Wiggle Sort II

 Kth Smallest Element in a Sorted Matrix

 Median of Two Sorted Arrays

 

 

Dynamic Programming

 Maximum Product Subarray

 Decode Ways

 Best Time to Buy and Sell Stock with Cooldown

 Perfect Squares

 Word Break

 Word Break II

 Burst Balloons

 

 

Design

 LRU Cache

 Implement Trie (Prefix Tree)

 Flatten Nested List Iterator

 Find Median from Data Stream

 Range Sum Query 2D - Mutable

 

 

Math

 Largest Number

 Max Points on a Line

 

 

Others

 Queue Reconstruction by Height

 Trapping Rain Water

 The Skyline Problem

 Largest Rectangle in Histogram

반응형
반응형

공유하기

facebook twitter kakaoTalk kakaostory naver band