태그모음 | Silicon Valley Koreans

2022.06.01

6859

[Easy - wk5 - Q3] 121. Best Time to Buy and Sell Stock 3

121.Best Time to Buy and Sell StockYou are given an arraypriceswhereprices[i]is …

2022.05.30

7943

[Easy - wk5 - Q2] 118. Pascal's Triangle

118.Pascal's TriangleGiven an integernumRows, return the first numRows ofPascal'…

2022.05.30

6305

[5/28] 268. Missing Number 2

268.Missing NumberEasy61032879Add to ListShareGiven an arraynumscontainingndisti…

2022.05.28

7549

[5/27] 1342. Number of Steps to Reduce a Number to Zero 1

1342.Number of Steps to Reduce a Number to ZeroEasy1738111Add to ListShareGiven …

2022.05.26

6718

[5/26] 191. Number of 1 Bits 1

[LeetCode 시즌 3] 2022년 5월 26일 문제입니다.https://leetcode.com/problems/number-of-1-bit…

2022.05.25

7164

[5/25] 354. Russian Doll Envelopes 1

[LeetCode 시즌 3] 2022년 5월 25일 문제입니다.https://leetcode.com/problems/russian-doll-en…

2022.05.24

7163

[5/24] 32. Longest Valid Parentheses 1

[LeetCode 시즌 3] 2022년 5월 24일 문제입니다.https://leetcode.com/problems/longest-valid-p…

2022.05.24

6719

[5/23] 474. Ones and Zeroes 1

[LeetCode 시즌 3] 2022년 5월 23일 문제입니다.https://leetcode.com/problems/ones-and-zeroes…

2022.05.24

6688

[Easy - wk4 - Q1] 94. Binary Tree Inorder Traversal 1

94.Binary Tree Inorder TraversalGiven therootof a binary tree, returnthe inorder…

2022.05.23

6506

[Easy - wk4 - Q3] 104. Maximum Depth of Binary Tree 3

104.Maximum Depth of Binary TreeGiven therootof a binary tree, returnits maximum…

2022.05.23

6649

[5/19] 329. Longest Increasing Path in a Matrix

[LeetCode 시즌 3] 2022년 5월 19일 문제입니다.https://leetcode.com/problems/longest-increas…

2022.05.18

7216

[Easy - wk3 - Q3] 88. Merge Sorted Array 3

88.Merge Sorted ArrayYou are given two integer arraysnums1andnums2, sorted innon…

2022.05.16

7011

[Easy - wk3 - Q2] 70. Climbing Stairs 4

70.Climbing StairsYou are climbing a staircase. It takesnsteps to reach the top.…

2022.05.16

7259

[Easy - wk3 - Q1] 69. Sqrt(x) 4

69.Sqrt(x)Given a non-negative integerx,compute and returnthe square root ofx.Si…