Go, Vantage point
가까운 곳을 걷지 않고 서는 먼 곳을 갈 수 없다.
Github | https://github.com/overnew/
Blog | https://everenew.tistory.com/
문제 https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-ii/ Longest Unequal Adjacent Groups Subsequence II - LeetCode Can you solve this real interview question? Longest Unequal Adjacent Groups Subsequence II - You are given an integer n, a 0-indexed string array words, and a 0-indexed array groups, both arrays having length n. The hamming distance between two strings of lee..
문제 https://leetcode.com/problems/count-of-sub-multisets-with-bounded-sum/description/ Count of Sub-Multisets With Bounded Sum - LeetCode Can you solve this real interview question? Count of Sub-Multisets With Bounded Sum - You are given a 0-indexed array nums of non-negative integers, and two integers l and r. Return the count of sub-multisets within nums where the sum of elements in each s leet..
문제 https://leetcode.com/problems/maximum-number-of-k-divisible-components/description/ Maximum Number of K-Divisible Components - LeetCode Can you solve this real interview question? Maximum Number of K-Divisible Components - There is an undirected tree with n nodes labeled from 0 to n - 1. You are given the integer n and a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] ind le..