일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 | 29 |
30 | 31 |
- 코테
- 프로그래머스
- 프로그래머스 java
- daily challenge
- 인텔리제이 에러
- leetcode 1721
- 카카오
- java leetcode
- 리트코드 자바
- Java
- 백준
- 파이썬
- 스택
- 백준 16935
- dfs
- 자바 리트코드
- BFS
- 리트코드 1557
- 구현
- 스프링 에러
- 백준 18222
- 코딩테스트
- 그래프 자바
- DP
- 분할정복
- leetcode
- 자바
- 리트코드
- 자바 5464
- java 프로그래머스
- Today
- Total
목록리트코드 자바 (3)
레벨업 일지
문제 https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/description/ Minimum Number of Vertices to Reach All Nodes - LeetCode Can you solve this real interview question? Minimum Number of Vertices to Reach All Nodes - Given a directed acyclic graph, with n vertices numbered from 0 to n-1, and an array edges where edges[i] = [fromi, toi] represents a directed edge from leet..
문제 https://leetcode.com/problems/swapping-nodes-in-a-linked-list/description/ Swapping Nodes in a Linked List - LeetCode Can you solve this real interview question? Swapping Nodes in a Linked List - You are given the head of a linked list, and an integer k. Return the head of the linked list after swapping the values of the kth node from the beginning and the kth node from t leetcode.com 알아야 할 개..
문제 https://leetcode.com/problems/substring-with-concatenation-of-all-words/description/ Substring with Concatenation of All Words - LeetCode Can you solve this real interview question? Substring with Concatenation of All Words - You are given a string s and an array of strings words. All the strings of words are of the same length. A concatenated substring in s is a substring that contains all l..