Merge Overlapping Interval
The city of Gridland is represented as an matrix where the rows are numbered from to and the columns are numbered from to .
코딩 문제 연습 및 풀이
The city of Gridland is represented as an matrix where the rows are numbered from to and the columns are numbered from to .
Consider a matrix where each cell contains either a or a . Any cell containing a is called a filled cell. Two cells are said to be connected if they are adja...
We define the following:
Ron and Hermione are deep in the Forbidden Forest collecting potion ingredients, and they’ve managed to lose their way. The path out of the forest is blocked...
Anna loves graph theory! She has a tree where each vertex is numbered from 1 to n, and each contains a data value.
HackerLand National Bank has a simple policy for warning clients about possible fraudulent account activity. If the amount spent by a client on a particular ...
In this challenge you need to print the string that accompanies each integer in a list sorted by the integers. If two strings are associated with the same in...
Whenever George asks Lily to hang out, she’s busy doing homework. George wants to help her finish it faster, but he’s in over his head! Can you help George u...
KinghtL is a chess piece that moves in an L shape. We define the possible moves of as any movement from some position \((x_1, y_1)\) to some \((x_2, y_2)\) s...
You will be given two arrays of integers and asked to determine all integers that satisfy the following two conditions:
Alice is playing an arcade game and wants to climb to the top of the leaderboard and wants to track her ranking. The game uses Dense Ranking, so its leaderbo...
Given a set of distinct integers, print the size of a maximal subset of S where the sum of any 2 numbers in \(S'\) is not evenly divisible by k.
n ordinary chess, the pieces are only of two colors, black and white. In our version of chess, we are including new pieces with unique movements. One of the ...
Function Description
문제 설명
문제 설명
그래프의 엣지가 주어졌을 때, 연결되어 있는 가장 큰 엣지의 개수와 가장 작은 수를 출력하는 문제이다.
문제 설명
탐욕법을 사용하여 주어진 숫자를 가장 크게 만드는 문제
최대한 많이 태워 구명보트를 적게 사용하는 문제이다.
문제 설명
힙을 사용하여 푸는 문제.
튜플로 이루어진 요소를 정리하는 문제이다. 카카오 인턴십 두번째 문제로 난이도는 낮은 편이다.
문제를 이해하는 거는 쉬웠지만 풀이 자체가 굉장히 어려웠던 문제다.
window를 옮겨가며 min max를 구하는 문제이다.
문제 설명