mschoi/CodeTest
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update Root Readme.md

Browse Source
This commit is contained in:
Myeongseon Choi
2024-10-22 10:19:47 +09:00
parent b53a38200f
commit 2d049ac512
1 changed files with 8 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
Readme.md
View File

@@ -13,23 +13,30 @@ Solved problem code in LeetCode, Baekjoon.
- [contains-duplicate](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/contains-duplicate)
- [contains-duplicate-ii](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/contains-duplicate-ii)
- [convert-sorted-array-to-binary-search-tree](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/convert-sorted-array-to-binary-search-tree)
- [distribute-candies-to-people](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/distribute-candies-to-people)
- [excel-sheet-column-number](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/excel-sheet-column-number)
- [excel-sheet-column-title](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/excel-sheet-column-title)
- [find-all-numbers-disappeared-in-an-array](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/find-all-numbers-disappeared-in-an-array)
- [find-kth-bit-in-nth-binary-string](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/find-kth-bit-in-nth-binary-string)
- [find-the-index-of-the-first-occurrence-in-a-string](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/find-the-index-of-the-first-occurrence-in-a-string)
- [happy-number](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/happy-number)
- [invert-binary-tree](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/invert-binary-tree)
- [isomorphic-strings](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/isomorphic-strings)
- [kth-largest-element-in-a-stream](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/kth-largest-element-in-a-stream)
- [length-of-last-word](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/length-of-last-word)
- [longest-common-prefix](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/longest-common-prefix)
- [longest-substring-without-repeating-characters](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/longest-substring-without-repeating-characters)
- [majority-element](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/majority-element)
- [maximum-average-subarray-i](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/maximum-average-subarray-i)
- [maximum-depth-of-binary-tree](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/maximum-depth-of-binary-tree)
- [maximum-square-area-by-removing-fences-from-a-field](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/maximum-square-area-by-removing-fences-from-a-field)
- [median-of-two-sorted-arrays](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/median-of-two-sorted-arrays)
- [merge-k-sorted-lists](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/merge-k-sorted-lists)
- [merge-sorted-array](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/merge-sorted-array)
- [merge-two-sorted-lists](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/merge-two-sorted-lists)
- [minimum-depth-of-binary-tree](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/minimum-depth-of-binary-tree)
- [number-of-1-bits](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/number-of-1-bits)
- [number-of-recent-calls](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/number-of-recent-calls)
- [number-of-submatrices-that-sum-to-target](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/number-of-submatrices-that-sum-to-target)
- [palindrome-number](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/palindrome-number)
- [pascals-triangle](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/pascals-triangle)
@@ -43,6 +50,7 @@ Solved problem code in LeetCode, Baekjoon.
- [remove-linked-list-elements](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/remove-linked-list-elements)
- [reverse-bits](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/reverse-bits)
- [reverse-linked-list](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/reverse-linked-list)
- [robot-return-to-origin](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/robot-return-to-origin)
- [roman-to-integer](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/roman-to-integer)
- [same-tree](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/same-tree)
- [score-of-a-string](https://git.teahaven.kr/mschoi/CodeTest/src/branch/main/leetcode/score-of-a-string)