LeetCode Typescript

Personal solutions of LeetCode problems on TypeScript.

Installation

git clone git@github.com:rromanv/leetcode-ts.git
pnpm install

Usage

pnpm test <number>

Problems

LeetCode Problem	Solution	Test	Difficulty
1. Two Sum	1.ts	1.spec.ts
14. Longest Common Prefix	14.ts	14.spec.ts
15. 3Sum	15.ts	15.spec.ts
20. Valid Parentheses	20.ts	20.spec.ts
21. Merge Two Sorted Lists	21.ts	21.spec.ts
22. Generate Parentheses	22.ts	22.spec.ts
19. Remove Nth Node From End of List	19.ts	19.spec.ts
23. Merge k Sorted Lists	23.ts	23.spec.ts
26. Remove Duplicates from Sorted Array	26.ts	26.spec.ts
33. Search in Rotated Sorted Array	33.ts	33.spec.ts
34. Find First and Last Position of Element in Sorted Array	34.ts	34.spec.ts
50. Pow(x, n)	50.ts	50.spec.ts
53. Maximum Subarray	53.ts	53.spec.ts
56. Merge Intervals	56.ts	56.spec.ts
65. Valid Number	65.ts	65.spec.ts
66. Plus One	66.ts	66.spec.ts
70. Climbing Stairs	70.ts	70.spec.ts
71. Simplify Path	71.ts	71.spec.ts
76. Minimum Window Substring	76.ts	76.spec.ts
78. Subsets	78.ts	78.spec.ts
88. Merge Sorted Array	88.ts	88.spec.ts
116. Populating Next Right Pointers in Each Node	116.ts	116.spec.ts
118. Pascal's Triangle	118.ts	118.spec.ts
121. Best Time to Buy and Sell Stock	121.ts	121.spec.ts
125. Valid Palindrome	125.ts	125.spec.ts
129. Sum Root to Leaf Numbers	129.ts	129.spec.ts
133. Clone Graph	133.ts	133.spec.ts
138. Copy List with Random Pointer	138.ts	138.spec.ts
162. Find Peak Element	162.ts	162.spec.ts
146. LRU Cache	146.ts	146.spec.ts
173. Binary Search Tree Iterator	173.ts	173.spec.ts
199. Binary Tree Right Side View	199.ts	199.spec.ts
200. Number of Islands	200.ts	200.spec.ts
207. Course Schedule	207.ts	207.spec.ts
219. Contains Duplicate II	219.ts	219.spec.ts
224. Basic Calculator	224.ts	224.spec.ts
227. Basic Calculator II	227.ts	227.spec.ts
235. Lowest Common Ancestor of a Binary Search Tree	235.ts	235.spec.ts
236. Lowest Common Ancestor of a Binary Tree	236.ts	236.spec.ts
246. Strobogrammatic Number	246.ts	246.spec.ts
249. Group Shifted Strings	249.ts	249.spec.ts
253. Meeting Rooms II	253.ts	253.spec.ts
270. Closest Binary Search Tree Value	270.ts	270.spec.ts
283. Move Zeroes	283.ts	283.spec.ts
314. Binary Tree Vertical Order Traversal	314.ts	314.spec.ts
339. Nested List Weight Sum	339.ts	339.spec.ts
348. Design Tic-Tac-Toe	348.ts	348.spec.ts
378. Kth Smallest Element in a Sorted Matrix	378.ts	378.spec.ts
392. Is Subsequence	392.ts	392.spec.ts
398. Random Pick Index	398.ts	398.spec.ts
408. Valid Word Abbreviation	408.ts	408.spec.ts
415. Add Strings	415.ts	415.spec.ts
426. Convert Binary Search Tree to Sorted Doubly Linked List	426.ts	426.spec.ts
480. Sliding Window Median	480.ts	480.spec.ts
498. Diagonal Traverse	498.ts	498.spec.ts
515. Find Largest Value in Each Tree Row	515.ts	515.spec.ts
523. Continuous Subarray Sum	523.ts	523.spec.ts
528. Random Pick with Weight	528.ts	528.spec.ts
536. Construct Binary Tree from String	536.ts	536.spec.ts
543. Diameter of Binary Tree	543.ts	543.spec.ts
560. Subarray Sum Equals K	560.ts	560.spec.ts
605. Can Place Flowers	605.ts	605.spec.ts
636. Exclusive Time of Functions	636.ts	636.spec.ts
647. Palindromic Substrings	647.ts	647.spec.ts
670. Maximum Swap	670.ts	670.spec.ts
680. Valid Palindrome II	680.ts	680.spec.ts
695. Max Area of Island	695.ts	695.spec.ts
708. Insert into a Sorted Circular Linked List	708.ts	708.spec.ts
766. Toeplitz Matrix	766.ts	766.spec.ts
791. Custom Sort String	791.ts	791.spec.ts
283. Move Zeroes	283.ts	283.spec.ts
295. Find Median from Data Stream	295.ts	295.spec.ts
824. Goat Latin	824.ts	824.spec.ts
791. Custom Sort String	791.ts	791.spec.ts
827. Making A Large Island	827.ts	827.spec.ts
863. All Nodes Distance K in Binary Tree	863.ts	863.spec.ts
938. Range Sum of BST	938.ts	938.spec.ts
958. Check Completeness of a Binary Tree	958.ts	958.spec.ts
921. Minimum Add to Make Parentheses Valid	921.ts	921.spec.ts
973. K Closest Points to Origin	973.ts	973.spec.ts
986. Interval List Intersections	986.ts	986.spec.ts
987. Vertical Order Traversal of a Binary Tree	987.ts	987.spec.ts
1004. Max Consecutive Ones III	1004.ts	1004.spec.ts
1047. Remove All Adjacent Duplicates In String	1047.ts	1047.spec.ts
1091. Shortest Path in Binary Matrix	1091.ts	1091.spec.ts
1249. Minimum Remove to Make Valid Parentheses	1249.ts	1249.spec.ts
1570. Dot Product of Two Sparse Vectors	1570.ts	1570.spec.ts
1539. Kth Missing Positive Number	1539.ts	1539.spec.ts
1650. Lowest Common Ancestor of a Binary Search Tree III	1650.ts	1650.spec.ts
1762. Buildings With an Ocean View	1762.ts	1762.spec.ts
1768. Merge Strings Alternately	1768.ts	1768.spec.ts
2858. Minimum Edge Reversals So Every Node Is Reachable	2858.ts	2858.spec.ts
3136. Valid Word	3136.ts	3136.spec.ts
3371. Identify the Largest Outlier in an Array	3371.ts	3371.spec.ts

License

MIT