LeetCode #118 Pascal'sTriangle. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #118 Pascal'sTriangle. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 LeetCode #118 Q. Given a non-negative integer numRows, generate the first numRows of Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers directly above it. e.g. Example: Input: 5 Output: [ [1..
LeetCode #88 MergeSortedAray. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #88 MergeSortedAray. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 어제 했던 병합정렬 쉬운 버전.. Easy version of the merge sort what i did yesterday.. LeetCode #88 Q. Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. 주어진 두개의 정렬된 정수 배열에서, 두개를 합쳐서 한개의 정렬된 배열을 만..
LeetCode #021 MergeTwoSortedLists. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #021 MergeTwoSortedLists. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 노드 구조체를 포인터 써서 이동함. 퍼포먼스 중상, 메모리 상 LeetCode #21 Q. Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 두개의 정렬된 연결리스트를 병합해서 새로운 리스..
LeetCode #202 HappyNumber. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #202 HappyNumber. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 30분정도.. 3번 제출.. 퍼포먼스 100%.. 30min.. submit 3 times.. 100% performance.. LeetCode #202 Q. Write an algorithm to determine if a number is "happy". A happy number is a number defined by the following process: Starting with any pos..
LeetCode #287 FindTheDuplicateNumber. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접, dyna..
LeetCode #287 FindTheDuplicateNumber. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접, dynamicProgramming 퍼포먼스 99프로 99% performance LeetCode #287 Q. Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Ass..
LeetCode #540 SingleElementInASortedArray. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #540 SingleElementInASortedArray. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 생각나는데로 풀이과정 정리안하고 막풀었더니 코드는 지저분한데 성능은 잘 나옴 LeetCode #540 Q. Given a sorted array consisting of only integers where every element appears twice except for one element which appears once. Find this single element ..
LeetCode #455 AssignCookies. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #455 AssignCookies. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 처음에 금방 푼 게 퍼포먼스가 너무 안 좋아서 중상 정도로 올리는데 시간 좀 걸림 병합정렬과 비슷한 방법이다. First solution had too bad performance, so i spent some time for tunning to upper mid performance It's similar with merge sort LeetCode #455 Q. Assume you are an a..
LeetCode #451 SortCharactersByFrequency. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #451 SortCharactersByFrequency. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 ascii 를 이용해서 다이나믹식으로 풀었는데, 정렬을 직접 해줘야해서 귀찮았지만 퍼포먼스 개잘나옴. 뿌듯.. Did it using dynamic programming, it was kinda lazy cuz I had to do sort by myself.. but performance is hella good. So.. worth it LeetCode #451Q. Given..
