LeetCode #590 N-aryTreePostorderTraversal. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,..
LeetCode #590 N-aryTreePostorderTraversal. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 Runtime: 144 ms, faster than 93.49% of C++ online submissions for N-ary Tree Postorder Traversal. Memory Usage: 32.3 MB, less than 87.53% of C++ online submissions for N-ary Tree Postorder Traversal. Shoul..
LeetCode #589 N-aryTreePreorderTraversal. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,..
LeetCode #589 N-aryTreePreorderTraversal. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 Runtime: 152 ms, faster than 69.24% of C++ online submissions for N-ary Tree Preorder Traversal. Memory Usage: 32.4 MB, less than 82.67% of C++ online submissions for N-ary Tree Preorder Should think about ..
LeetCode #905 SortArrayByParity. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리..
LeetCode #905 SortArrayByParity. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 Runtime: 32 ms, faster than 32.07% of C++ online submissions for Sort Array By Parity. Memory Usage: 9.6 MB, less than 70.44% of C++ online submissions for Sort Array By Parity. LeetCode #905 Q. Given an array A of ..
LeetCode #994 RottingOranges. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트
LeetCode #994 RottingOranges. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 Performance was Comme ci comme ca Runtime: 8 ms, faster than 71.18% of C++ online submissions for Rotting Oranges. Memory Usage: 9.1 MB, less than 71.94% of C++ online submissions for Rotting Oranges. LeetCode #994 Q. ..
How to check mainboard serialnumber, information. 컴퓨터 보드 시리얼넘버 정보 확인하는 방법 (Windows)
In cmd, type below. wmic baseboard get manufacturer, product, serialnumber, version cmd 창에서 아래의 명령어를 친다. wmic baseboard get manufacturer, product, serialnumber, version 2019/06/26 - [Programming/Software Architecture] - Software Engineering (You aren't gonna need it, Yagni) 소프트웨어 개발에서 고려되어야 할 부분 (야그니), agile, 에자일 2019/06/12 - [Programming/C++] - How to remove specific value in vector. 벡터 배열에서 특정..
LeetCode #766 ToeplitzMatrix. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트
LeetCode #766 ToeplitzMatrix. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 Runtime: 12 ms, faster than 88.34% of C++ online submissions for Toeplitz Matrix. Memory Usage: 9.7 MB, less than 56.29% of C++ online submissions for Toeplitz Matrix. LeetCode #766 Q. A matrix is Toeplitz if every dia..
LeetCode #771 JewelsAndStones. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스..
LeetCode #771 JewelsAndStones. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 어려운건 어려운대로 잘 안풀려서 스트레스 쉬운건 쉬운대로 너무 쉽게 풀려서 스트레스 Difficult problem is so hard to solve, it makes me mad Easy problem is too easy to handle it, it also makes me mad God...d Runtime: 4 ms, faster than 86.23% of C++ online..
