solve leetcode with different language
| ID | Title | Difficulty | Type | Lauguage |
|---|---|---|---|---|
| 0001 | Two Sum | easy | Array | kotlin |
| 0002 | Add Two Numbers | Medium | ListNode | kotlin |
| 0003 | Longest Substring Without Repeating Characters | Medium | HashMap | kotlin |
| 0004 | Median of Two Sorted Arrays | Hard | Binary Search | kotlin |
| 0005 | Longest Palindromic Substring | Medium | DP, CommonSubString | kotlin |
| 0006 | ZigZag Conversion | Medium | Math | kotlin |
| 0007 | Reverse Integer | Easy | Boundary Conditions | kotlin |
| 0008 | String to Integer (atoi) | Medium | Boundary Conditions | kotlin |
| 0009 | Palindrome Number | Easy | kotlin | |
| 0010_0 | Regular Expression Matching | Hard* | DP | kotlin |
| 0011 | Container With Most Water | Medium | Two Points | kotlin |
| 0012 | Integer to Roman | Medium | String, Math | kotlin |
| 0013 | Roman to Integer | Easy | Map | kotlin |
| 0014 | Longest Common Prefix | Easy | String | kotlin |
| 0015_0 | 3Sum | Medium | Boundary Conditions | kotlin |
| 0016 | 3Sum Closest | Medium | Two point | kotlin |
| 0017 | Letter Combinations of a Phone Number | Medium | String | kotlin |
| 0018_0 | 4Sum | Medium | 3Sum | kotlin |
| 0019 | Remove Nth Node From End of List | Medium | ListNode, newHead | kotlin |
| 0020 | Valid Parentheses | Easy | Stack | kotlin |
| 0021 | Merge Two Sorted Lists | Easy | LinkedList | kotlin |
| 0022_0 | Generate Parentheses | Medium | backtracking | kotlin |
| 0023 | Merge k Sorted Lists | Hard | Merge Sort | kotlin |
| 0024 | Swap Nodes in Pairs | Medium | Recursion | kotlin |
| 0025_1 | Reverse Nodes in k-Group | Hard | Recursion | kotlin |
| 0026 | Remove Duplicates from Sorted Array | Easy | Array | kotlin |
| 0027 | Remove Element | Easy | Array | kotlin |
| 0028 | Implement strStr | Easy | String Match | kotlin |
| 0029_0 | Divide Two Integers | Medium | Boundary Conditions | kotlin |