profile
캬-!
태그 목록
전체보기 (73)JavaScript(32)leetcode(26)Java(23)algorithm(13)array(11)recursion(10)easy(7)Sort(6)List(3)iterable(3)프로그래머스(3)String(3)binary tree(3)reverse(3)medium(3)DP(3)integer(3)iterator(2)daily(2)BFS(2)DFS(2)this(2)arrow function(2)도메인(2)matrix(2)ES6(2)stream(2)palindrome(2)bit(2)set(2)Coding(2)scope(2)Problem(2)도메인 지식(2)stack(2)sliding(2)recursive(2)bind(1)linked list(1)queue(1)bipartite(1)back(1)heap(1)일반함수(1)anagram(1)aws lambda(1)null == undefined(1)sequence(1)generator(1)validation(1)rest parameter(1)나머지 매개변수(1)color(1)false(1)선언식(1)표현식(1)React(1)LOL(1)Module(1)알고리즘(1)null(1)Object.assign(1)spead operator(1)전개 연산자(1)정리(1)byte(1)divide(1)Quick Sort(1)number(1)Coursera(1)network(1)cidr(1)subnetmask(1)domain(1)host(1)고차함수(1)ip(1)값지향(1)Generic(1)dynamic connectivity(1)unival(1)IO(1)hoisting(1)압축(1)frequency(1)BinaryTree(1)Node(1)REST API(1)iter(1)Symbol.iterator(1)next(1)cycle(1)addition(1)two pointer(1)lexicographical(1)universal value(1)regex(1)tree(1)206(1)context(1)DUPLICATE(1)programming(1)Parentheses(1)reduce(1)arithmetic(1)splice(1)HashSet(1)type(1)bitwise(1)Pop(1)missing(1)uf(1)스타트업(1)화살표 함수(1)scheduling(1)정렬(1)GCD(1)max(1)disjoint set(1)minimum(1)aws(1)객체지향(1)diff(1)binary(1)Map(1)division(1)backwards(1)arraLike(1)subtraction(1)hash(1)timeover(1)BigInt(1)algorithm1(1)closure(1)private(1)static ip(1)dynamic ip(1)engine(1)apply(1)call(1)typescript(1)search(1)binary_search(1)undefined(1)플랫폼(1)배열(1)disk(1)the first one alphabetically(1)UnionFind(1)API(1)binarystring(1)greedy(1)muliplication(1)subarray(1)push(1)Graph(1)라이브러리(1)프레임워크(1)OOP(1)Symbol(1)sum(1)merge(1)
post-thumbnail

[leetcode] missing number

Time: O(NlogN)Space: O(1)

약 8시간 전
·
0개의 댓글
post-thumbnail

[leetcode]

Time: O(N); two for loop iterating NSpace: O(N); HashMap contains N elements at mostTime: O(nlogn); sortingSpace: O(1)

2일 전
·
0개의 댓글
post-thumbnail

[leetcode]575. Distribute Candies

problem code 1st try

3일 전
·
0개의 댓글
post-thumbnail

[leetcode] Maximum Frequency Stack

I don't need to track the sequence of numbers....just need to track max frequency and frequency of each numbervar FreqStack = function() { this.top

3일 전
·
0개의 댓글
post-thumbnail

[leetcode] validate stack sequences

push -> peek: check if pop element is equal if yes -> pop, continueif no -> pushbreak ifpop index is equal to length of pushed aray andstack is not em

5일 전
·
0개의 댓글
post-thumbnail

[leetcode] Shortest Unsorted Continuous Subarray

Time: O(N)Space: O(1)but code is too longTime: O(nlogn), 100 times slower than 1st try

6일 전
·
0개의 댓글
post-thumbnail

[leetcode] Score of Parentheses

Time: O(N)Space: O(N)from leetcode "SlovakUnion"The idea is a(x + y) <=> ax + ayTIME: O(N)Space: O(1)

2021년 2월 25일
·
0개의 댓글
post-thumbnail

[leetcode] broken calculator

with whilewith recursionTime: O(logY)Space: O(1), only cnt;

2021년 2월 22일
·
0개의 댓글
post-thumbnail

[leetcode] Roman to Integer

Time: O(N),Space: O(1), some language String is a char\[]

2021년 2월 20일
·
0개의 댓글

[leetcode] arithmetic slices

Time: O(N)Space: O(N), how to make this to O(1)?O(1) space

2021년 2월 19일
·
0개의 댓글
post-thumbnail

[leetcode] Container With Most Water

Time: O(N)Space: O(1)

2021년 2월 18일
·
0개의 댓글
post-thumbnail

[leetcode] Letter Case Permutation

Time: O(N + 2^N)Space: O(2^N)

2021년 2월 17일
·
0개의 댓글
post-thumbnail

[leetcode]

Time: O(mn + nlogn)Space: O(m + k)

2021년 2월 16일
·
0개의 댓글

constant space

Constance space means no matter how n increases the space ur code using stays equal.

2021년 2월 15일
·
0개의 댓글