https://github.com/chtozamm/leetcode

My solutions for LeetCode problems
https://github.com/chtozamm/leetcode

go leetcode typescript

Last synced: 21 days ago
JSON representation

My solutions for LeetCode problems

• Host: GitHub
• URL: https://github.com/chtozamm/leetcode
• Owner: chtozamm
• Created: 2024-07-05T20:51:20.000Z (6 months ago)
• Default Branch: main
• Last Pushed: 2024-12-13T21:10:24.000Z (23 days ago)
• Last Synced: 2024-12-13T21:24:06.153Z (23 days ago)
• Topics: go, leetcode, typescript
• Language: Go
• Homepage:
• Size: 201 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# LeetCode

| #    | Title                                                                | Solution                                 |

| ---- | -------------------------------------------------------------------- | ---------------------------------------- |

| 796  | Rotate String                                                        | [TypeScript](/typescript/problems/796/)  |

| 1190 | Reverse Substrings Between Each Pair of Parentheses                  | [Go](/go/problems/1190)                  |

| 1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | [Go](/go/problems/1509)                  |

| 1518 | Water Bottles                                                        | [Go](/go/problems/1518)                  |

| 1598 | Crawler Log Folder                                                   | [Go](/go/problems/1598)                  |

| 1701 | Average Waiting Time                                                 | [Go](/go/problems/1701)                  |

| 1717 | Maximum Score From Removing Substrings                               | [Go](/go/problems/1717)                  |

| 1823 | Find the Winner of the Circular Game                                 | [Go](/go/problems/1823)                  |

| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | [Go](/go/problems/2058)                  |

| 2096 | Step-By-Step Directions From a Binary Tree Node to Another           | [Go](/go/problems/2096)                  |

| 2134 | Minimum Swaps to Group All 1's Together II                           | [Go](/go/problems/2134)                  |

| 2196 | Create Binary Tree From Descriptions                                 | [Go](/go/problems/2196)                  |

| 2582 | Pass the Pillow                                                      | [Go](/go/problems/2582)                  |

| 2593 | Find Score of an Array After Marking All Elements                    | [Go](/go/problems/2593)                  |

| 2751 | Robot Collisions                                                     | [Go](/go/problems/2751)                  |

| 2769 | Find the Maximum Achievable Number                                   | [TypeScript](/typescript/problems/2769/) |

| 2807 | Insert Greatest Common Divisors in Linked List                       | [TypeScript](/typescript/problems/2807/) |

| 2825 | Make String a Subsequence Using Cyclic Increments                    | [Go](/go/problems/2825)                  |

| 3136 | Valid Word                                                           | [Go](/go/problems/3136)                  |

| 3163 | String Compression III                                               | [TypeScript](/typescript/problems/3163/) |