-
Default checker used atm is wcmp which is great to compare tokens and ignore trailing whitespaces and EOL (also similar checkers are commonly used on several platforms, primarily Codeforces).
But a…
-
## Link of the question
https://leetcode.com/problems/simplify-path/
## Coding platform
- [ ] Hackerrank
- [ ] HackerEarth
- [ ] Codechef
- [ ] Codeforces
- [x] Leetcode
- [ ] InterviewBit…
-
## Link of the question
Question Link : https://practice.geeksforgeeks.org/problems/missing-number-in-array1416/1
I want to work on this issue. Can you please assign me
## Coding platform
- […
-
## Link of the question
I want to work on this issue in CPP with Hacktoberfest label
https://www.hackerrank.com/challenges/beautiful-days-at-the-movies/problem
## Coding platform
- [x] Hackerr…
-
## Link of the question
Provide the link of the question and ask for assignment of the issue.
https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
## Coding platform
- [ ] Hackerrank
…
-
## Link of the question
I would like to work on this issue in CPP with Hacktoberfest label
https://www.hackerrank.com/challenges/find-digits/problem
## Coding platform
- [x] Hackerrank
- [ ] …
-
## Link of the question
I would like to work on this issue in CPP with Hacktoberfest label
https://www.hackerrank.com/challenges/icecream-parlor/problem
## Coding platform
- [x] Hackerrank
- …
-
## Link of the question
https://leetcode.com/problems/median-of-two-sorted-arrays/
## Coding platform
- [ ] Hackerrank
- [ ] HackerEarth
- [ ] Codechef
- [ ] Codeforces
- [x] Leetcode
- [ …
-
### 주제 이름
* O(N log N) Euclidean MST
### 주제 소개 (관련 자료 링크 포함)
2차원 평면 상에 N개의 점이 주어지고, 간선의 가중치가 유클리드 거리로 정의되었을 때 MST를 구하는 문제
들로네 삼각분할을 이용해 O(N log N)에 간선을 3N개 이하로 줄이는 방법을 통해 O(N log N)에 구할 수 있음…
-
Suppose you want to write an example for PDF view of an interactive problem.
Such example usually goes in two columns, with empty lines to show the order of interaction, like this:
```
input1
inpu…