Algorithms problems' solutions with TypeScript, includes algorithms
data-structure \ interviews \ leetcode \ lcoffer problems.
Power by deno.lang
Array¹², Dynamic Programming⁴, Math³, String¹, Tree¹,
| # | Title | Topics | Difficulty |
|---|---|---|---|
| 1 | Two Sum | String | Easy |
| 3 | longest-substring-without-repeating-characters | Array,Dynamic Programming,Math,String | Easy |
| 4 | median-of-two-sorted-arrays | String | Hard |
| 14 | longest-common-prefix | String | Easy |
| 17 | letter-combinations-of-a-phone-number | String | Easy |
| 50 | powx-n | String | Easy |
| 74 | search-a-2d-matrix | String | Easy |
| 136 | single-number | String | Medium |
| 169 | majority-element | String | Easy |
| 202 | happy-number | String | Easy |
| 240 | search-a-2d-matrix-ii | String | Easy |
| 344 | reverse-string | String | Easy |
| 724 | find-pivot-inde | String | Hard |
deno test // all deno test ./leetcode/0001.two-sum // scope- -A, --allow-read
Author: Yalda
Github: leetcode-ts
Online Book: www.yalda.cn/leetcode-ts
