LeetCode #442 FindAllDuplicatesInAnArray. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #442 FindAllDuplicatesInAnArray. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 부가적으로 제시한 제한 조건에 딱 맞는 것을 딱히 못 떠올려서 성능/메모리 둘다 안좋음 LeetCode #442Q. Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements that appear ..
LeetCode #283 MoveZeroes #2. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #283 MoveZeroes #2. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 쉬운거 한개만 빨리 푸려고 아무거나 풀었는데 풀고 저장하려고 보니 예전에 풀었던거.. 이번에 그냥 푼게 퍼포먼스 더 잘나옴.. (32ms -> 20ms) I just picked and solved easy one, but it was what i was solved in the past... Anyway, it's better performance. (32ms -> 20ms) LeetCode #28..
LeetCode #637 AverageOfLevelsInBinaryTree. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #637 AverageOfLevelsInBinaryTree. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 퍼포먼스 개잘나옴 Performance is good af LeetCode #637Q. Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array. 비어있지 않은 이진트리가 주어지고, 배열의 형태로 되어있는 각 레벨의 노드들 값의 평균을 반환해라..
LeetCode #566 ReshapeTheMatrix. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,Matlab resh..
LeetCode #566 ReshapeTheMatrix. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,Matlab reshape Got difficulties with how to initialize vector in vector with size which I want. Performance is not bad, memory usage is bad. 벡터 안에 벡터 원하는 사이즈로 초기화 하는 방법을 몰라서 좀 헤멤, 퍼포먼스 나쁘지 않음 메모리 나쁨 LeetCode #566Q. In MATL..
LeetCode #559 MaximumDepthOfN-aryTree. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #559 MaximumDepthOfN-aryTree. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 트리는 풀 때마다 새로워서 재밌음, 퍼포먼스 88% 메모리 76% 둘다 괜춘 Tree structure is always new to me, so it's always interesting. Performance 88%, Memory 76%, kinda good. LeetCode #559Q.Given a n-ary tree, find its maximum depth.The maxim..
LeetCode #557 reverseWordsInAString3. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #557 reverseWordsInAString3. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 금방 떠오르고 금방 코딩됐지만 퍼포먼스가 꽝 Solution came up with very easily and coding easily too, but performance is shitty LeetCode #557Q.Given a string, you need to reverse the order of characters in each word within a sentence wh..
LeetCode #551 StudentAttendanceRecord1. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #551 StudentAttendanceRecord1. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 막 풀고 예외케이스 그때그때 틀어막아서 풀었더니 풀고나서 만족감이 떨어짐.. 퍼포먼스는 100%.. I solved just trying again and again, and fixed exception case after submit. So.. I cannot satisfied with it even if I solved.. performance is 100% tho.. Leet..
LeetCode #520 DetectCapital. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #520 DetectCapital. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 문제 자체는 단순히 조건문으로만 풀 수 있는데, if if if 들어가는게 별로 보기 좋진 않음최초 한바퀴에 전체 대/소문자 나타내는 bit 이나 map 을 만들어놓고 해볼까 하다가 성능이 더 좋을 것 같진 않아서 그냥 풀었는데if 분기 많이 하긴 했는데도 퍼포먼스는 100% 나옴 LeetCode #520Q. Given a word, you need to judge whether the usage o..