problem

Time: O(4^4)space: O(4^4)

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

problem code 1st try: check A[i] > A[i +2], if yes, return false

Time: O(N), deleteSpace: O(N)

Time: O(log^2N), count(1 << i) logN, equals LogNSpace: O(Log^N), why? there are 30 arrays for power of 2s < 10000000000

문제1: bcypt.hash를 사용해 model.create(data) 할 때The first argument must be of type string or an instance of Buffer, ArrayBuffer, or Array or an Array-like

problem code

2nd try:

problem co

add 4xx 9xx where x is 0 or '', this problem becomes a lot easier.Time: O(1)Space: O(1)

댓글 플러그인페이스북에서 제공하는 댓글 플러그인 사용

problem c

problem code 1st try: Brute force Time: O(N^3) Space: O(1) 2nd try: sliding door

1일차 구도 마크다운 파일 읽어오기 간단한 css

need to understand difference between substrings and subsequencesabbab => subsequences = aa, bbb, abba, abbab, ... is palindromic subsequenceswe can r

블로그 만들어야지만 생각만 한지 오래만들자는 느낌이 왔을 때 만들자정리용 - 일정 기간 공부한 내용 복습할 겸 둘러보기홍보용 - 그냥?부가수입 - 과연?reactreduxtypescript - 연습할겸helmetgoogle analyticsgoogle adsensegi

problem code 1st try: simple

abba => bb is palindromic. for (x)bb(y), x == y then, it is palindromic

Time: O(N^2\*M), N is the length of the words, M is the length of wordsiSpace: O(1)