CP

https://codeforces.com/contest/1516/problem/A시간 1초, 메모리 256MBinput :t (1≤t≤20)n k(2≤n≤100 , 1≤k≤10000)a1 , a2, …, an (0≤ai≤100)output : print the

https://codeforces.com/contest/1516/problem/B시간 1초, 메모리 256MBinput :t (1≤t≤15)n (2≤n≤2000)a1 , a2, …, an (0≤ai<2^30)output : all elements equ

https://codeforces.com/contest/1539/problem/B시간 1초, 메모리 256MBinput :n q (1≤n≤100000, 1≤q≤100000)s (consisting of n lowercase letters of English l

https://codeforces.com/contest/1539/problem/A 시간 1초, 메모리 256MB input : k (1≤k≤1000) n, x, t (1≤n,x,t≤2⋅109) output : i번째 테스트 케이스에서 dissatisfaction

https://codeforces.com/contest/1539/problem/C시간 1초, 메모리 256MBinput :n, k, x (1≤n≤200000, 0≤k≤10^18)a1,a2,…,an (1≤ai≤10^18)output : In the only li

https://codeforces.com/contest/1539/problem/D시간 1초, 메모리 256MBinput :n (1≤n≤100000)ai bi (1 ≤ ai ≤ 10^14, 1 ≤ bi ≤ 10^14)output : Output the minim

https://codeforces.com/contest/1516/problem/A시간 1초, 메모리 256MBinput :t (1≤t≤1000)n (1≤n≤50)a1,…,an (−10^4≤ai≤10^4)output : For each test case, o

https://codeforces.com/contest/1537/problem/B시간 1초, 메모리 256MBinput :t (1≤t≤10^4)n, m, i, j (1≤n,m≤10^9, 1≤i≤n, 1≤j≤m)output : For each test case,

https://codeforces.com/contest/1537/problem/C시간 1초, 메모리 256MBinput :t (1≤t≤100)n (2≤n≤2⋅10^5)h1,…,hn (1≤hi≤10^9)output : For each test case, outp

https://codeforces.com/contest/1536/problem/A시간 2초, 메모리 256MBinput :t (1≤t≤50)n (2≤n≤100)a1,a2,⋯,an (−100≤ai≤100)output : For each test case, o

https://codeforces.com/contest/1536/problem/B시간 2초, 메모리 256MBinput :t (1≤t≤1000)n (1≤n≤1000)output : For each test case, output the MEX of the st

https://codeforces.com/contest/1536/problem/C시간 2초, 메모리 256MBinput :t (1≤t≤1000)n (1≤n≤5⋅10^5)s ('D', 'K'로 이루어진 문자열)output : For each test case,

https://codeforces.com/contest/1516/problem/A시간 1초, 메모리 256MBinput :t (1≤t≤1000)n (2≤n≤25)a1,a2,…,a2n (1≤ai≤109)output : For each testcase, you

https://codeforces.com/contest/1526/problem/B시간 1초, 메모리 256MBinput :t (1≤t≤10000)x (1≤x≤109) output : For each testcase, you should output a sing

https://codeforces.com/contest/1526/problem/C1https://codeforces.com/contest/1526/problem/C2시간 1초, 메모리 256MBinput :n (1≤n≤2000)a1 , a2, ...

https://codeforces.com/contest/1529/problem/A시간 1초, 메모리 256MBinput :t (1≤t≤100)n (1≤n≤100)a1,a2,…,an (1≤ai≤100)output : For each test case print

https://codeforces.com/contest/1529/problem/B시간 1초, 메모리 256MBinput :t (1≤t≤104)n (1≤n≤105)a1, a2, …, an (−109 ≤ ai ≤ 109)output : For each test

https://codeforces.com/contest/1529/problem/C시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 250)n (2 ≤ n ≤ 105)li ri (1 ≤ li ≤ ri ≤ 109).u v (1 ≤ u, v ≤ n, u≠

https://codeforces.com/contest/1527/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 3⋅104)n (1 ≤ n ≤ 109)output : For each test case, output a single

https://codeforces.com/contest/1527/problem/B1시간 1초, 메모리 256MBinput :t (1≤t≤103)n (1≤n≤103)string s of length noutput : For each test case print

https://codeforces.com/contest/1527/problem/B2시간 1초, 메모리 256MBinput :t (1≤t≤103)n (1≤n≤103)string s of length noutput : For each test case print

https://codeforces.com/contest/1527/problem/C시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 105)n (2 ≤ n ≤ 105)a1, a2, …, an (0 ≤ ai ≤ 100)output : For each t

https://codeforces.com/contest/1525/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 100)k(1 ≤ k ≤ 100)output : For each test case, print the minimum n

https://codeforces.com/contest/1525/problem/B시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 2000)n (3 ≤ n ≤ 50)n distinct integers from 1 to noutput : For ea

https://codeforces.com/contest/1525/problem/C시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 1000)n m (1 ≤ n ≤ 3⋅105; 2 ≤ m ≤ 108)x1, x2, …, xn (0 < xi <

https://codeforces.com/contest/1525/problem/A시간 2초, 메모리 256MBinput :n (2 ≤ n ≤ 5000)a1, a2, …, an (0 ≤ ai ≤ 1)output : Print one integer — the m

https://codeforces.com/contest/1521/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 10000)A B (1 ≤ A ≤ 106, 1 ≤ B ≤ 106)output : For each test case p

https://codeforces.com/contest/1521/problem/B시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 10000)n (1 ≤ n ≤ 105)a1, a2, …, an (1 ≤ ai ≤ 109)output : For ea

https://codeforces.com/contest/1520/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 1000)n (1 ≤ n ≤ 50)output : For each test case output:"YES", if th

https://codeforces.com/contest/1520/problem/B시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 109)output : For each test case output the number o

https://codeforces.com/contest/1520/problem/C시간 4초, 메모리 256MBinput :t (1 ≤ t ≤ 100)n (1 ≤ n ≤ 100)output : For each test case, output:\-1, if the

https://codeforces.com/contest/1520/problem/D시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 2 \* 105)a1 , a2, …, an (0 ≤ ai ≤ n)output : For ea

https://codeforces.com/contest/1520/problem/E시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 2 \* 106)a string of length noutput : For each test

https://codeforces.com/contest/1520/problem/F1시간 1초, 메모리 256MBInteractionn t (1 ≤ n ≤ 2⋅105, t=1).k (1 ≤ k ≤ n). It is guaranteed that at the mom

https://codeforces.com/contest/1519/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 1000)r b d (1 ≤ r,b ≤ 109; 0 ≤ d ≤ 109)output : For each test case

https://codeforces.com/contest/1529/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 100)n m k (1 ≤ n,m ≤ 100; 0 ≤ k ≤ 104)output : For each test case,

https://codeforces.com/contest/1519/problem/C시간 2초, 메모리 256MBinput :t (1 ≤ t ≤1000)n (1 ≤ n ≤ 2⋅105)u1, u2, …, un (1 ≤ ui ≤ n)s1, s2, …, sn (1 ≤

https://codeforces.com/contest/1519/problem/D시간 2초, 메모리 256MBinput :n (1 ≤ n ≤ 5000)a1, a2, …, an (1 ≤ ai ≤ 107)b1, b2, …, bn (1 ≤ bi ≤ 107)outpu

https://codeforces.com/contest/1514/problem/A시간 1초, 메모리 256MBinput :t (1≤t≤100)n (1≤n≤100)a1 , a2, …, an (1 ≤ ai ≤ 104)output : If there's a subs

https://codeforces.com/contest/1514/problem/A시간 1초, 메모리 256MBinput :t (1≤t≤10)n k (1≤n≤105, 1≤k≤20).output : For each test case, print the number

https://codeforces.com/contest/1514/problem/C시간 1초, 메모리 256MBinput :n (2 ≤ n ≤ 105)output : The first line should contain a single integer, the

https://codeforces.com/contest/1509/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 500)n (2 ≤ n ≤ 2000) a1 , a2, ..., an (1 ≤ ai ≤ 2⋅105)output : For

https://codeforces.com/contest/1509/problem/B시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 5000)n (3 ≤ n ≤ 105) a string of length n consisting of only the c

https://codeforces.com/contest/1509/problem/C시간 1초, 메모리 256MBinput :n (1 ≤ n ≤ 2000) s1 , s2, ..., sn (1 ≤ si ≤ 109)output : Print a single integ

https://codeforces.com/contest/1509/problem/D시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 103)n (1 ≤ n ≤ 105) a bitstring of length 2noutput : For each test

https://atcoder.jp/contests/abc210/tasks/abc210_a시간 2초, 메모리 1024MBinput :N A X Y (1 ≤ N, A ≤ 105, 1 ≤ Y < X ≤ 100)output : Print the amount of

https://atcoder.jp/contests/abc210/tasks/abc210_b시간 2초, 메모리 1024MBinput :N (1 ≤ N ≤ 105)S (S is a string of length N consisting of 0 and 1)output

https://atcoder.jp/contests/abc210/tasks/abc210_c시간 2초, 메모리 1024MBinput :N K (1 ≤ N ≤ K ≤ 2 \* 105)c1, c2, ..., cnoutput : Print the maximum poss

https://atcoder.jp/contests/abc210/tasks/abc210_d시간 2초, 메모리 1024MBinput :H W C (2 ≤ H, W ≤ 1000, 1 ≤ C ≤ 109)각 배열의 원소 (1 ≤ Aij ≤ 109output : Prin

https://codeforces.com/contest/1511/problem/A시간 2초, 메모리 256MBinput :t (1≤t≤104)n (1≤n≤50)r1, r2, …, rn (1 ≤ ri ≤ 3)output : For each testcase pri

https://codeforces.com/contest/1511/problem/B시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 285)a b c (1 ≤ a,b ≤ 9, 1 ≤ c ≤ min(a,b))output : For each testcas

https://codeforces.com/contest/1511/problem/C시간 2초, 메모리 256MBinput :n q (2 ≤ n ≤ 3⋅105; 1 ≤ q ≤ 3⋅105)a1, a2, …, an (1 ≤ ai ≤ 50)t1, t2, …, tn (1

https://codeforces.com/contest/1511/problem/D시간 2초, 메모리 256MBinput :n k (1 ≤ n ≤ 2⋅105; 1 ≤ k ≤ 26)output : Print the string s such that it consi

https://codeforces.com/contest/1536/problem/D시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 5⋅105)b1, b2, …, bn (−109 ≤ bi ≤ 109)output : For e

https://codeforces.com/contest/1513/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 100)n k(1 ≤ n ≤ 100)(0 <= k <= n)output : Output t lines. Fo

https://codeforces.com/contest/1513/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 100)n k(1 ≤ n ≤ 100)(0 <= k <= n)output : Output t lines. Fo

https://codeforces.com/contest/1513/problem/C시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 2⋅104)n t (1 ≤ n ≤ 109)(1 ≤ t ≤ 2⋅105)output : For each test case

https://codeforces.com/contest/1553/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 1000)n (1 ≤ n ≤ 109)output : Print t integers, the i-th should be

https://codeforces.com/contest/1553/problem/B시간 3초, 메모리 256MBinput :q (1 ≤ q ≤ 500)s (1 ≤ |s| ≤ 500)t (1 ≤ |t| ≤ 2⋅|s|−1)output : For each test c

https://codeforces.com/contest/1553/problem/C시간 3초, 메모리 256MBinput :t (1 ≤ t ≤ 1000)one line containing the string s, consisting of exactly 10 ch

https://codeforces.com/contest/1553/problem/D시간 2초, 메모리 256MBinput :q (1 ≤ q ≤ 105) s (1 ≤ |s| ≤ 105)t (1 ≤ |t| ≤ 105)output : For each test case

https://codeforces.com/contest/1512/problem/A시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 100)n (3 ≤ n ≤ 100)a1, a1, …, a1 (1 ≤ ai ≤ 100)output : For each t

https://codeforces.com/contest/1512/problem/B시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 400)n (2 ≤ n ≤ 400)'.' 혹은 '\*'로 이루어진 길이 n짜리 문장output : For each te

https://codeforces.com/contest/1512/problem/A시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)a b(0 ≤ a, b ≤ 2 \* 105)a + b 길이의 문자열output : "-1", if you can

https://codeforces.com/contest/1512/problem/D시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 2 \* 105)b1, b2, …, bn + 2 (1 ≤ bi ≤ 109)output : "

https://codeforces.com/contest/1512/problem/E시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 500)n l r s (1 ≤ n ≤ 500)(1 ≤ l ≤ r ≤ n)(1 ≤ s ≤ n(n+1) / 2).outpu

https://codeforces.com/contest/1504/problem/A시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)소문자로 이뤄진 문장 soutput : For each test case, if there is no solut

https://codeforces.com/contest/1504/problem/B시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 3⋅105)a b (길이 n, consisting of symbols 0 and 1)outp

https://codeforces.com/contest/1504/problem/C시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (2 ≤ n ≤ 2⋅104, n is even).s (n길이의 문자열)output : If such two

https://codeforces.com/contest/1498/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 104)숫자 noutput : Output t lines, where the i-th line is a single i

https://codeforces.com/contest/1498/problem/B시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 5 \* 103)n W(1 ≤ n ≤ 105)(1 ≤ W ≤ 109)w1, w2, …, wn (1 ≤ wi ≤ 106)

https://codeforces.com/contest/1498/problem/C시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 100)n k (1 ≤ n,k ≤ 1000)output : Output t integers, The i-th of th

https://codeforces.com/contest/1506/problem/A시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n m x(1 ≤ n, k ≤ 106)(1 ≤ x ≤ n ⋅ m)output : For each test cas

https://codeforces.com/contest/1506/problem/B시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 500)n k(1 ≤ k ≤ n ≤ 50)string s of length noutput : For each test

https://codeforces.com/contest/1506/problem/C시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 100)string a (1 ≤ |a| ≤ 20)string b (1 ≤ |b| ≤ 20)output : For eac

https://codeforces.com/contest/1506/problem/D시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n(1 ≤ n ≤ 2 \* 105)a1, a2, …, an (1 ≤ ai ≤ 109).output : For e

https://codeforces.com/contest/1506/problem/E시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n(1 ≤ n ≤ 2 \* 105)q1, q2, …, qn (1 ≤ qi ≤ n).output : For eac

https://codeforces.com/contest/1484/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 100)a b (1 ≤ a, b ≤ 100)output : For each test case print the sing

https://codeforces.com/contest/1484/problem/B시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 105)n (1 ≤ n ≤ 105)a1, a2, …, an (0 ≤ ai ≤ 109 )output : For ever

https://codeforces.com/contest/1484/problem/C시간 2초, 메모리 512MBinput :t (1 ≤ t ≤ 10000)n m (1 ≤ n, m ≤ 100000)ki, fi1, ..., fiki(1 ≤ ki, fij ≤ n)ou

https://codeforces.com/contest/1499/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 3000)n k1 k2 (1 ≤ n ≤ 1000; 0 ≤ k1, k2 ≤ n)w b (0 ≤ w, b ≤ n).outp

https://codeforces.com/contest/1499/problem/B시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 1000)s (2 ≤ |s| ≤ 100)output : For each testcase print "YES" if th

https://codeforces.com/contest/1497/problem/A시간 초, 메모리 256MBinput :t (1 ≤ t ≤ 100)n (1 ≤ n ≤ 100)a1, a2, ..., an(1 ≤ ai ≤ 100)output : For each t

https://codeforces.com/contest/1497/problem/B시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 1000)n, m (1 ≤ n, m ≤ 105)a1, a2, ..., an(1 ≤ ai ≤ 109)output : Fo

https://codeforces.com/contest/1497/problem/C1https://codeforces.com/contest/1497/problem/C2시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n k (3 ≤ n

https://codeforces.com/contest/1497/problem/E1시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 1000)n k (1 ≤ n ≤ 2 \* 105, k = 0)a1, a2, ..., an(1 <= ai <

https://codeforces.com/contest/1541/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 100)n (1 ≤ n ≤ 100)output : Output t answers, one for each test ca

https://codeforces.com/contest/1541/problem/B시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 105)a1, a2, ..., an(1 <= ai <= 2 \* n)output

https://codeforces.com/contest/1541/problem/C시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 105)d1, d2, ..., dn(1 <= di <= 109)output : F

https://codeforces.com/contest/1561/problem/A시간 2초, 메모리 512MBinput :t (1 ≤ t ≤ 100)n (3 ≤ n ≤ 999)a1, a2, ..., an(1 <= ai <= n)output : For

https://codeforces.com/contest/1561/problem/B시간 2초, 메모리 512MBinput :t (1 ≤ t ≤ 103)a b (0 ≤ a, b ≤ 105, a + b > 0)output : For each test case pri

https://codeforces.com/contest/1561/problem/C시간 2초, 메모리 512MBinput :t (1 ≤ t ≤ 105)n (1 ≤ t ≤ 105)ki ai,1, ai,2, ..., ai,ki (1 ≤ ki ≤ 105)(1 ≤ ai

https://codeforces.com/contest/1562/problem/A시간 1초, 메모리 512MBinput :t (1 ≤ t ≤ 104)l r (1 ≤ l ≤ r ≤ 109)output : For every test case, output the

https://codeforces.com/contest/1562/problem/B시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 103)k (1 ≤ k ≤ 50)noutput : For every test case, print two numbers

https://codeforces.com/contest/1562/problem/C시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 103)n (2 ≤ t ≤ 2 \* 104)non-empty binary string output : For every

https://codeforces.com/contest/1556/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 104)c d (0 ≤ c, d ≤ 109)output : For each test case output a singl

https://codeforces.com/contest/1556/problem/B시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 105)a1, a2, …, an (1 ≤ ai ≤ 105)output : For each t

https://codeforces.com/contest/1556/problem/C시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 1000)c1, c2, …, cn (1 ≤ ci ≤ 109)output : Output a single integer

https://codeforces.com/contest/1624/problem/A시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 50)a1, a2, …, an (1 ≤ an ≤ 109)output : the minim

https://codeforces.com/contest/1624/problem/B시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)a b c (1 ≤ a, b, c ≤ 10^8).output : if Polycarp can choose a p

https://codeforces.com/contest/1624/problem/C시간 3초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 50)a1, a2, …, an (1 ≤ ai ≤ 109)output : "YES" if y

https://codeforces.com/contest/1624/problem/D시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n k (1 ≤ k ≤ n ≤ 2 \* 105)s (n개의 알파벳으로 이루어진 문자열)output : outpu

https://codeforces.com/contest/1624/problem/G시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)empty linen m (3 ≤ n ≤ 2 \* 105, n − 1 ≤ m ≤ 2 \* 105)vi ui wi

https://codeforces.com/contest/1711/problem/C시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n m k (3 ≤ n, n ≤ 109, 1 ≤ k ≤ 105)a1 a2 ... ai (1 ≤ ai ≤ 109)

https://codeforces.com/contest/1706/problem/C시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (3 ≤ n ≤ 105)h1 h2 ... hn (1 ≤ hi ≤ 109)output : print a sin

https://codeforces.com/contest/1706/problem/D1시간 4초, 메모리 64MBinput :t (1 ≤ t ≤ 100)n k (1 ≤ n, k ≤ 3000)a1 a2 ... ai (1 ≤ a1 ≤ a2 ≤ an ≤ 109)outp

https://leetcode.com/problems/median-of-two-sorted-arrays/input :nums1 nums20 <= len(nums1) <= 10000 <= len(nums2) <= 1000output : nu

https://leetcode.com/problems/path-with-maximum-probability/input :n, edges, succPro, start, end2 <= n <= 10^4output : start에서 end까지 이동하며 가

https://leetcode.com/problems/regular-expression-matching/description/input :s, ps는 영어 소문자, p는 영어 소문자 + "." + "\*"로 이루어져 있다.output : s라는 문장을 p로 표

https://leetcode.com/problems/longest-substring-without-repeating-characters/description/?envType=featured-list&envId=top-google-questionsinput :

https://leetcode.com/problems/longest-palindromic-substring/?envType=featured-list&envId=top-google-questionsinput :soutput : 가장 긴 palindromic 부분

https://leetcode.com/problems/zigzag-conversion/?envType=featured-list&envId=top-google-questionsinput :s, numRowsoutput : s 문자열을 지그재그 형태로 나열 했을

https://leetcode.com/problems/string-to-integer-atoi/description/ input : s, numRows output : s 문자열을 지그재그 형태로 나열 했을 때의 문자열을 출력하시오. 조건 : 지그 재그의 시

https://leetcode.com/problems/reverse-integer/?envType=featured-list&envId=top-google-questionsinput :xoutput : x로 입력 받은 숫자를 뒤집어 출력하시오.조건 :int의 범

https://leetcode.com/problems/container-with-most-water/description/input :heightoutput : 2개의 line을 가지고 담을 수 있는 최대한의 물의 양을 출력하시오.조건 :물은 기울여서 담을 수

https://leetcode.com/problems/add-two-numbers/description/?envType=featured-list&envId=top-google-questionsinput :l1, l2output : 링크드 리스트로 연결된 두 숫

https://leetcode.com/problems/integer-to-roman/?envType=featured-list&envId=top-google-questionsinput :numoutput : 입력 받은 수를 로마 숫자로 출력하시오.조건 :I ca

https://leetcode.com/problems/3sum/?envType=featured-list&envId=top-google-questionsinput :numsoutput : 3개의 원소를 더하였을 떄 0이 되는 원소들의 집합을 출력하시오.조건 :원

https://leetcode.com/problems/3sum-closest/?envType=featured-list&envId=top-google-questionsinput :nums, targetoutput : 3개의 원소를 더하였을 떄 target과 가장

https://leetcode.com/problems/letter-combinations-of-a-phone-number/?envType=featured-list&envId=top-google-questionsinput :digitsoutput : digits

https://leetcode.com/problems/4sum/description/input :nums, targetoutput : target을 만들 수 있는 모든 집합의 원소들을 반환하시오.조건 :1 <= nums.length <= 200Sol

https://leetcode.com/problems/remove-nth-node-from-end-of-list/?envType=featured-list&envId=top-google-questionsinput :head, noutput : 뒤에서부터 n번째

https://leetcode.com/problems/generate-parentheses/?envType=featured-list&envId=top-google-questionsinput :noutput : 각 n개의 "(", ")"를 이용하여 만들 수 있는

https://leetcode.com/problems/merge-k-sorted-lists/description/input :listsoutput : 모든 싱글 링크드 리스트의 원소를 오름차순으로 정렬한 head를 반환하시오.조건 :Solution explai

https://leetcode.com/problems/swap-nodes-in-pairs/?envType=featured-list&envId=top-google-questionsinput :headoutput : 모든 인접한 1개의 노드끼리 값이 swap된 형

https://leetcode.com/problems/reverse-nodes-in-k-group/?envType=featured-list&envId=top-google-questionsinput :head, koutput : 모든 인접한 k개의 노드끼리 값이

https://leetcode.com/problems/substring-with-concatenation-of-all-words/?envType=featured-list&envId=top-google-questionsinput :s, wordsoutput :

https://leetcode.com/problems/divide-two-integers/?envType=featured-list&envId=top-google-questionsinput :dividend, divisoroutput : 나눗셈의 몫을 출력하시오

https://leetcode.com/problems/next-permutation/editorial/?envType=featured-list&envId=top-google-questionsinput :numsoutput : lexicographical ord

https://leetcode.com/problems/longest-valid-parentheses/description/?envType=featured-list&envId=top-google-questionsinput :soutput : 가장 길이가 긴 pa

https://leetcode.com/problems/search-in-rotated-sorted-array/description/?envType=featured-list&envId=top-google-questionsinput :nums, targetoutp

https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/?envType=featured-list&envId=top-google-questionsinput :num

https://leetcode.com/problems/valid-sudoku/?envType=featured-list&envId=top-google-questionsinput :boardoutput : 현재 주어진 스도쿠 판이 규칙에 적절한지를 판별하여 Tru

https://leetcode.com/problems/sudoku-solver/description/?envType=featured-list&envId=top-google-questionsinput :boardoutput : 현재 주어진 스도쿠를 해결하시오.조

https://leetcode.com/problems/count-and-say/?envType=featured-list&envId=top-google-questionsinput :noutput : 재귀적 수행을 이루어 나온 숫자를 읽은 것을 출력하시오.조건 :

https://leetcode.com/problems/combination-sum/description/?envType=featured-list&envId=top-google-questionsinput :candidates, targetoutput : cand

https://leetcode.com/problems/combination-sum-ii/?envType=featured-list&envId=top-google-questionsinput :candidates, targetoutput : candidates의 원

https://leetcode.com/problems/first-missing-positive/description/?envType=featured-list&envId=top-google-questionsinput :numsoutput : 양수 중 등장하지 않

https://leetcode.com/problems/trapping-rain-water/description/?envType=featured-list&envId=top-google-questionsinput :heightoutput : 비가 오고 난 후 고여

https://leetcode.com/problems/multiply-strings/description/?envType=featured-list&envId=top-google-questionsinput :num1, num2output : 두 수의 곱셈 결과를

https://leetcode.com/problems/jump-game-ii/description/?envType=featured-list&envId=top-google-questionsinput :numsoutput : nums-1에 도착하기 위한 최소 점프

https://leetcode.com/problems/wildcard-matching/description/?envType=featured-list&envId=top-google-questions%3FenvType%3Dfeatured-list&envId=top

https://leetcode.com/problems/permutations/description/?envType=featured-list&envId=top-google-questions?envType=featured-list&envId=top-google-q

https://leetcode.com/problems/permutations-ii/description/?envType=featured-list&envId=top-google-questions?envType=featured-list&envId=top-googl

https://leetcode.com/problems/rotate-image/description/?envType=featured-list&envId=top-google-questions?envType=featured-list&envId=top-google-q

https://leetcode.com/problems/group-anagrams/description/?envType=featured-list&envId=top-google-questions?envType=featured-list&envId=top-google

https://leetcode.com/problems/powx-n/description/?envType=featured-list&envId=top-google-questions%3FenvType%3Dfeatured-list&envId=top-google-question

https://leetcode.com/problems/n-queens/description/?envType=featured-list&envId=top-google-questions%3FenvType%3Dfeatured-list&envId=top-google-q

https://leetcode.com/problems/maximum-subarray/?envType=featured-list&envId=top-google-questions?envType=featured-list&envId=top-google-questions

https://leetcode.com/problems/spiral-matrix/?envType=featured-list&envId=top-google-questions?envType=featured-list&envId=top-google-questionsinp

https://leetcode.com/problems/jump-game/description/?envType=featured-list&envId=top-google-questions%3FenvType%3Dfeatured-list&envId=top-google-

https://leetcode.com/problems/merge-intervals/description/?envType=featured-list&envId=top-google-questions?envType=featured-list&envId=top-googl

https://leetcode.com/problems/insert-interval/description/?envType=featured-list&envId=top-google-questions?envType=featured-list&envId=top-googl

https://leetcode.com/problems/spiral-matrix-ii/description/?envType=featured-list&envId=top-google-questions?envType=featured-list&envId=top-goog

https://leetcode.com/problems/permutation-sequence/description/?envType=featured-list&envId=top-google-questions%3FenvType%3Dfeatured-list&envId=