일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | ||||||
2 | 3 | 4 | 5 | 6 | 7 | 8 |
9 | 10 | 11 | 12 | 13 | 14 | 15 |
16 | 17 | 18 | 19 | 20 | 21 | 22 |
23 | 24 | 25 | 26 | 27 | 28 |
- daily challenge
- Java
- 파이썬
- DP
- 백준 16935
- 카카오
- 리트코드
- 자바 5464
- BFS
- 프로그래머스 java
- leetcode 1721
- 분할정복
- 프로그래머스
- 스프링 에러
- 자바
- 코딩테스트
- 리트코드 1557
- 백준
- 구현
- 인텔리제이 에러
- dfs
- leetcode
- 그래프 자바
- 스택
- java leetcode
- java 프로그래머스
- 자바 리트코드
- 리트코드 자바
- 코테
- 백준 18222
- Today
- Total
목록자바 리트코드 (3)
레벨업 일지
문제 https://leetcode.com/problems/maximum-width-of-binary-tree/description/ Maximum Width of Binary Tree - LeetCode Can you solve this real interview question? Maximum Width of Binary Tree - Given the root of a binary tree, return the maximum width of the given tree. The maximum width of a tree is the maximum width among all levels. The width of one level is defined as leetcode.com 알아야 할 개념 BFS 탐..
문제 https://leetcode.com/problems/best-team-with-no-conflicts/ Best Team With No Conflicts - LeetCode Best Team With No Conflicts - You are the manager of a basketball team. For the upcoming tournament, you want to choose the team with the highest overall score. The score of the team is the sum of scores of all the players in the team. However, the basketb leetcode.com Given two lists, scores and..
문제 https://leetcode.com/problems/data-stream-as-disjoint-intervals/description/ Data Stream as Disjoint Intervals - LeetCode Data Stream as Disjoint Intervals - Given a data stream input of non-negative integers a1, a2, ..., an, summarize the numbers seen so far as a list of disjoint intervals. Implement the SummaryRanges class: * SummaryRanges() Initializes the object with an e leetcode.com 주어진..