반응형 https://leetcode.com/problems/permutation-in-string/description/ Permutation in String - LeetCode Permutation in String - Given two strings s1 and s2, return true if s2 contains a permutation of s1, ... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/zigzag-conversion/ Zigzag Conversion - LeetCode Zigzag Conversion - The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you ... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/longest-common-prefix/description/ Longest Common Prefix - LeetCode Longest Common Prefix - Write a function to find the longest common prefix string amongst an array of stri... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/verifying-an-alien-dictionary/ Verifying an Alien Dictionary - LeetCode Verifying an Alien Dictionary - In an alien language, surprisingly, they also use English lowercas... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/two-sum/description/ Two Sum - LeetCode Two Sum - Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/n-th-tribonacci-number/ 간단한 dp 문제였습니다. dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3] class Solution { public: int dp[38] = {0, 1, 1}; int tribonacci(int n) { for(int i=3; i<=n; i++... Tag: Algorithm, leetcode

반응형 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, y... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/greatest-common-divisor-of-strings/​ Greatest Common Divisor of Strings - LeetCode Greatest Common Divisor of Strings - For two strings s and t, we say "t divides s" if and only i... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/cheapest-flights-within-k-stops/des​cription/ Cheapest Flights Within K Stops - LeetCode Cheapest Flights Within K Stops - There are n cities connected by some number of fli... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/concatenated-words/description/ Concatenated Words - LeetCode Concatenated Words - Given an array of strings words (without duplicates), return all the concatenated words... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/data-stream-as-disjoint-intervals/d​escription/ Data Stream as Disjoint Intervals - LeetCode Data Stream as Disjoint Intervals - Given a data stream input of non-negative inte... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/lfu-cache/description/ LFU Cache - LeetCode LFU Cache - Design and implement a data structure for a Least Frequently Used (LFU) [https://en.wikipedia.org/wiki/Least_freq... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/palindrome-partitioning/description​/ Palindrome Partitioning - LeetCode Palindrome Partitioning - Given a string s, partition s such that every substring of the partition ... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/find-the-town-judge/description/ Find the Town Judge - LeetCode Find the Town Judge - In a town, there are n people labeled from 1 to n. There is a rumor that one of thes... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/snakes-and-ladders/description/ Snakes and Ladders - LeetCode Snakes and Ladders - You are given an n x n integer matrix board where the cells are labeled from 1 to n2 in ... Tag: Algorithm, leetcode