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..
LeetCode #237 DeleteNodeInALinkedList. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연..
LeetCode #237 DeleteNodeInALinkedList. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 문제 설명이 거지같았지만 쉬운 문제.. 노드의 포인터를 따라가서 주소값이 가리키는 값 자체를 바꿔준다. Need to understand pointer LeetCode #237 Q. Write a function to delete a node (except the tail) in a singly linked list, given only access to that node..
LeetCode #206 ReverseLinkedList. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리..
LeetCode #206 ReverseLinkedList. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 다른거 풀다가 길 잘못들어서 한참 헤메다가 쉬운거라도 빨리 풀고 자려고 골랐는데 이것도 좀 걸림.. 퍼포먼스는 최상, 메모리는 최하 Performance 100% , Memory 10% LeetCode #206 Q. Reverse a singly linked list. 단방향 싱글연결리스트를 뒤집어라 Example: Input: 1->2->3->4->5->NULL Output: 5-..
LeetCode #141 LinkedListCycle. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스..
LeetCode #141 LinkedListCycle. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스트 퍼포먼스 최최최상 Perfekto performance LeetCode #141 Q. Given a linked list, determine if it has a cycle in it. To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in..
LeetCode #121 BestTimeToBuyAndSellStock. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #121 BestTimeToBuyAndSellStock. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 퍼포먼스 최악 The worst performance LeetCode #121 Q. Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (i.e., buy one ..
LeetCode #119 Pascal'sTriangle2. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접, 파스칼..
LeetCode #119 Pascal'sTriangle2. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접LeetCode #119 Pascal'sTriangle2. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접, 파스칼의 삼각형, Pascal, 파스칼 파스칼의삼각형1번 문제와 거의 유사하고,..
