LeetCode #1002 FindCommonCharacters. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결..
LeetCode #1002 FindCommonCharacters. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 간만에 보람있는 문제였고 성능 잘나옴 Runtime: 12 ms, faster than 94.94% of C++ online submissions for Find Common Characters. Memory Usage: 11.5 MB, less than 23.59% of C++ online submissions for Find Common Characters. LeetCod..
LeetCode #965 UnivaluedBinaryTree. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결..
LeetCode #965 UnivaluedBinaryTree. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 Performance 96% Memory 60% LeetCode #965 Q. A binary tree is univalued if every node in the tree has the same value. Return true if and only if the given tree is univalued. 이진트리의 모든 노드 값이 같은 값이면 univalued 라고 한다. u..
LeetCode #509 FibonacciNumber. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스..
LeetCode #509 FibonacciNumber. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 Performance 40% Memory 30% LeetCode #509 Q. The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and ..
LeetCode #506 RelativeRanks. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트
LeetCode #506 RelativeRanks. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 Performance 10% Memory both 30% Super bad LeetCode #506 Q. Given scores of N athletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Silver Medal"..
LeetCode #383 RansomNote. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트
LeetCode #383 RansomNote. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 Performance 99% Memory both 99%% LeetCode #383 Q. Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constru..
LeetCode #389 FindTheDifference. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리..
LeetCode #389 FindTheDifference. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 Performance and Memory both 99%%% LeetCode #389 Q. Given two strings s and t which consist of only lowercase letters. String t is generated by random shuffling string s and then add one more letter at a random posit..
LeetCode #326 PowerOfThree. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트
LeetCode #326 PowerOfThree. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 Performance and Memory both good LeetCode #237 Q. Given an integer, write a function to determine if it is a power of three. 주어진 정수로, 3의 제곱 수인지 확인하는 함수를 만들어라. e.g. Example 1: Input: 27 Output: true Example 2: Input: 0 Ou..
