레벨업 일지

알아야 할 개념 링크드리스트 문제 https://leetcode.com/problems/design-browser-history/description/ Design Browser History - LeetCode Can you solve this real interview question? Design Browser History - You have a browser of one tab where you start on the homepage and you can visit another url, get back in the history number of steps or move forward in the history number of steps. Implem leetcode.com 웹사이트 뒤로가기..

문제 LeetCode - The World's Leading Online Programming Learning Platform Sudoku Solver - LeetCode Sudoku Solver - Write a program to solve a Sudoku puzzle by filling the empty cells. A sudoku solution must satisfy all of the following rules: 1. Each of the digits 1-9 must occur exactly once in each row. 2. Each of the digits 1-9 must occur exactly once leetcode.com 알아야 할 개념 brute force 구현 재귀 함수 풀이..

문제 https://leetcode.com/problems/n-th-tribonacci-number/description/ N-th Tribonacci Number - LeetCode N-th Tribonacci Number - The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given n, return the value of Tn. Example 1: Input: n = 4 Output: 4 Explanation: T_3 = 0 + 1 + 1 = 2 T_4 = 1 + 1 leetcode.com 트라이보나치 수열 값을 구해서 리턴할 것. 알아야 할 개..

문제 https://leetcode.com/problems/cheapest-flights-within-k-stops/description/ Cheapest Flights Within K Stops - LeetCode Cheapest Flights Within K Stops - There are n cities connected by some number of flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates that there is a flight from city fromi to city toi with cost pricei. You are also giv leetcode.com 최대 k +1..

문제 Bus Routes - LeetCode Bus Routes - LeetCode Bus Routes - You are given an array routes representing bus routes where routes[i] is a bus route that the ith bus repeats forever. * For example, if routes[0] = [1, 5, 7], this means that the 0th bus travels in the sequence 1 -> 5 -> 7 -> 1 -> 5 -> 7 -> 1 leetcode.com 버스 탄 총 횟수를 구하는 문제 알아야 할 개념 자바 인접 리스트 해시맵 HashMap 구조 https://0713k.tistory.com/30 ..

문제 https://leetcode.com/problems/search-insert-position/description/ Search Insert Position - LeetCode Search Insert Position - Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You must write an algorithm with O(log n) runtime com leetcode.com 이진 탐색을 할줄 아니? 물어보는 문제 풀이 정렬..

https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/ Minimum Number of Arrows to Burst Balloons - LeetCode Minimum Number of Arrows to Burst Balloons - There are some spherical balloons taped onto a flat wall that represents the XY-plane. The balloons are represented as a 2D integer array points where points[i] = [xstart, xend] denotes a balloon whose horizonta l..

Frequency of the Most Frequent Element - LeetCode Frequency of the Most Frequent Element - LeetCode Frequency of the Most Frequent Element - The frequency of an element is the number of times it occurs in an array. You are given an integer array nums and an integer k. In one operation, you can choose an index of nums and increment the element at that ind leetcode.com 문제 최대 빈도수 구하기 문제. 풀이 투 포인터를 ..