1230 - 세그먼트 트리 최솟값 수열과 쿼리 17 11/20 [세그먼트 트리] RMQ ( Range Minimum Query ) 공부할땐 앞에 방법도 괜찮지만, 대회에서는 최소값 구할때 무조건 세그먼트 트리. 왜냐하면 이것은 O(sqrt(N))을 O(logN)으로 줄인것이기 때문이다.) DP는 변경이 복잡해서 세그먼트트리가 무조건 좋다. 매우 중요한 자료구조니까 꼭 스스로 코딩해보세요. 11/23 [참고] 잠이와서 좀.. 소스코드 특히 다시 한번 보자. 12/13 필기하던거 다 날아감.ㅠㅠ 1. 루트N으로 나누기 sqrt decomposition 2. dp - 트리2에서 LCA랑 비슷하다. 앞쪽과 뒷쪽으로 나누는 dp 3. 세그먼트 트리 : 가장 좋은 방법 ( lgN) : 1,2번은 공부용으로 괜찮지만..
코딩인터뷰계의 바이블인 'Cracking the coding interview(영어) / 코딩인터뷰완전 정복(한국어)'를 집필한 Gayle Laakmann McDowell 의 동영상 강의 입니다. 자막은 LLY라는 크롬 플러그인을 이용하면 한글로 볼 수 있습니다. youtube.com/playlist?list=PLI1t_8YX-Apv-UiRlnZwqqrRT8D1RhriX Data Structures www.youtube.com youtube.com/playlist?list=PLI1t_8YX-ApvMthLj56t1Rf-Buio5Y8KL Algorithms www.youtube.com
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 클래식 인터뷰 질문 목록입니다. 우리의 주요 인터뷰 질문은 다음 시리즈로 나뉩니다. Easy Collection Medium Collection Hard Collection to help you master Data Structure & Algorithms and improve your coding skills. 데이터 구..
소개 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: Easy Collection Medium Collection Hard Collection to help you master Data Structure & Algorit..
리트코드에 공식 큐레이팅 된 코딩 인터뷰에 자주 출제되는 문제의 목록입니다. 인터뷰 준비를 하는데 있어서, 모든 문제를 훑어 보실것을 강력 추천 합니다. 깊고 느리게, 우보만리 우직한 소처럼 천천히 걸어서 만리를 간다. 천천히 가더라도 끝까지 목표를 이룬다. 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 클래식 인터뷰 질문 목록입니다. 우리의 주요 인터뷰 질문은 다음 ..
leetcode.com/contest/weekly-contest-224/ Welcome to Weekly Contest 224! Feel free to share and post your contest experience here! You can also view the rankings for the contest here. Links to the individual problems are included below: Number Of Rectangles That Can Form The Largest Square (3 points) Tuple with Same Product (4 points) Largest Submatrix With Rearrangements (5 points) Cat and Mouse..
leetcode.com/contest/weekly-contest-223 Welcome to Weekly Contest 223! Feel free to share and post your contest experience here! You can also view the rankings for the contest here. Links to the individual problems are included below: Decode XORed Array (3 points) Swapping Nodes in a Linked List (4 points) Minimize Hamming Distance After Swap Operations (5 points) Find Minimum Time to Finish All..
한국에서는 백준사이트나 알고스팟 등을 주로 하지만, 해외취업을 원한다면 리트코드가 필수라고 생각한다. 특히 구글, 페이스북, 아마존, 넷플릭스, 애플 등에 취업하기를 원한다면 다른 사이트나 책 보다는 리트코드에서 각 회사별로 나와있는 기출 문제를 풀어야 한다. 합격을 위해서는 리트코드 문제를 몇개 풀어야 할까? 지인들의 경우를 봤을때, 가장 어려운 구글의 경우는 최소 400문제, 난이도는 이지/미디움/하드 중 무조건 하드 포함이다. 1000문제 푸신분도 많다. 공부할때는 미디움까지 포함해서 풀면 되는것 같다. (구글은 하드) 가장 쉽다고 생각되는 아마존의 경우는 최소 100문제, 특히 트리와 그래프의 이지문제는 척척 풀어내야한다. 인터뷰에서 중요한것은 문제해결능력 그리고 소통과 협업이다. 하지만 문제를 ..
leetcode.com/problems/kth-largest-element-in-an-array/ 이 문제는 굉장히 중요하다. 왜냐하면 퀵소트(퀵셀렉트)로 푸는 문제이기 때문이다. 215. Kth Largest Element in an Array Medium 4928318Add to ListShare Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. Example 1: Input: [3,2,1,5,6,4] and k = 2 Output: 5 Example 2: Input: [3,2,3,1,2,4,5,5,..
Google 1658. Minimum Operations to Reduce X to Zero Medium 4569Add to ListShare You are given an integer array nums and an integer x. In one operation, you can either remove the leftmost or the rightmost element from the array nums and subtract its value from x. Note that this modifies the array for future operations. Return the minimum number of operations to reduce x to exactly 0 if it's possi..
881. Boats to Save People Medium 101944Add to ListShare The i-th person has weight people[i], and each boat can carry a maximum weight of limit. Each boat carries at most 2 people at the same time, provided the sum of the weight of those people is at most limit. Return the minimum number of boats to carry every given person. (It is guaranteed each person can be carried by a boat.) Example 1: Inp..
This is how I got 1 million Facebook followers I've been using Facebook for years. One thing that has been consistent is unless you spend money on ads, it's hard to grow. But that doesn't mean all hope is lost. There is still a way to grow without ads. It's how I did it. Here are the exact 6 steps you need to follow (step 5 is optional): Go through this overview on Facebook marketing. (takes 7 m..
127. Word Ladder leetcode.com/problems/word-ladder/ Hard 43961374Add to ListShare Given two words beginWord and endWord, and a dictionary wordList, return the length of the shortest transformation sequence from beginWord to endWord, such that: Only one letter can be changed at a time. Each transformed word must exist in the word list. Return 0 if there is no such transformation sequence. Example..
코딩 인터뷰 준비 방법의 큰 결함? Evan, 2018-08-12 00:02:16 안녕하세요, 전에 질문 글 올리고 답변에 대해서 매우 감사하고 있는 Evan입니다! 사실, 다음 주에 여행을 떠나기 전 일요일 같은 때에 제 Coding interview 준비 방법의 결함에 대해서 더 깊게 알아가고자 합니다. 제가 질문을 하고, 다른 사람들의 답변을 보고 다른 job seeker 분들도 많이 배울 수 있지 않을까해서 이런 곳에 다가 질문을 올립니다. 질문 글 올리게 되는 계기: 주변의 Software Development과 프로그래밍에 자부심을 느끼고 사랑해서 tech 관련 meetup을 열어주는 소프트웨어 장인들, staff engineers, CTO 에게 Data Structure / Algorithm..
1539. Kth Missing Positive Number leetcode.com/problems/kth-missing-positive-number/ O(N)과 O(lgN)이 존재하므로 흥미롭다고 생각되는 문제 Easy 54918Add to ListShare Given an array arr of positive integers sorted in a strictly increasing order, and an integer k. Find the kth positive integer that is missing from this array. Example 1: Input: arr = [2,3,4,7,11], k = 5 Output: 9 Explanation: The missing positive inte..
Hi Everyone, I have browsed through multiple websites like LeetCode, Glassdoor, CareerCup, etc. to find the most frequent Facebook system design interview questions. Due to the sheer volume of content, I have summarized the top questions so that I can share them with a large audience and everyone can benefit from them 🙂 And, thanks to the LeetCode community for helping me prepare for the intervi..
leetcode.com/discuss/general-discussion/1000929/solved-all-dynamic-programming-dp-problems-in-7-months Solved all dynamic programming (dp) problems in 7 months. - LeetCode Discuss Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com Hi All, I just completed my DP adventure which I started in las..
Others Here are some other questions that do not fit in other categories. We recommend: Number of 1 Bits Valid Parentheses. 191. Number of 1 Bits leetcode.com/problems/number-of-1-bits/ Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight). Note: Note that in some languages such as Java, there is no unsigned integer type. In ..
classroom.udacity.com/courses/ud330 Authentication & Authorization: OAuth LESSON 1 Authentication vs Authorization Learn the difference between authentication and authorization and some best practices in developing a login system. Learn Ajax Learn jQuery Set up your Google account. Set up your Facebook account. Check out Udacity's awesome course on Applied Cryptography if you are interested in l..
classroom.udacity.com/courses/ud088. Full Stack Foundations LESSON 1 Working with CRUD Learn the CRUD pattern (Create, Read, Update, Delete) and how it relates to RESTful architectures and to the operations of a database-backed web service. LESSON 2 Making a Web Server Build a web service in Python that uses your database to implement CRUD operations. LESSON 3 Developing with frameworks Apply th..
leetcode.com/explore/learn/card/binary-search/ left + (right - left) // 2 class Solution: def search(self, nums: List[int], target: int) -> int: n = len(nums) l = 0 r = n-1 while l ythat means2yx That means one could rewrite the recursion above as \textrm{mySqrt}(x) = \textrm{mySqrt}(x >> 2) >2) int: l = 0 r = len(nums) - 1 n = len(nums) def find_rotate_index(left, right): if nums[left] < nums[..
leetcode.com/contest/weekly-contest-222 222 9692 4096 1594 664 247 42.26% 16.45% 6.85% 2.55% 12.58% My 2021 is ruined :( TLE for both q2 and q3 1710. Maximum Units on a Truck leetcode.com/problems/maximum-units-on-a-truck/ class Solution: def maximumUnits(self, boxTypes: List[List[int]], truckSize: int) -> int: boxTypes.sort(key=lambda x: -x[1]) max_units = 0 for n, units in boxTypes: max_units ..
Math Most of the math questions asked in interviews do not require math knowledge beyond middle school level. We recommend: Count Primes Power of Three. 412. Fizz Buzz leetcode.com/problems/fizz-buzz/ 피즈버즈 하나 가지고도 이런 다양한 토론을 할수 있군.. Solution You must have played FizzBuzz as kids. FizzBuzz charm never gets old. And so here we are looking at how you can take on one step at a time and impress your ..