This repository contains solutions to LeetCode problems implemented in Typescript. LeetCode is a popular platform for practicing coding skills and preparing for technical interviews. The problems are categorized based on their difficulty level, ranging from easy to hard.
Each solution is implemented in Typescript and includes a link to the LeetCode problem and a link to the solution file. These solutions are meant to be used as a reference for learning and understanding problem-solving techniques, data structures, and algorithms.
To run these solutions, you can simply copy and paste the code into the LeetCode online editor or your local Typescript environment.
Problem Number | Solution Name | Solution Link | LeetCode Problem Link |
---|---|---|---|
1 | Two Sum | Link | Link |
9 | Palindrome Number | Link | Link |
20 | Palindrome Number | Link | Link |
485 | Max Consecutive Ones | Link | Link |
509 | Fibonacci Number | Link | Link |
704 | Binary Search | Link | Link |
709 | To Lower Case | Link | Link |
771 | Jewels and Stones | Link | Link |
1108 | Defanging an IP Address | Link | Link |
1281 | Subtract the Product and Sum of Digits of an Integer | Link | Link |
1816 | Truncate Sentence | Link | Link |
1832 | Check If the Sentence Is Pangram | Link | Link |
1929 | Concatenation of Array | Link | Link |
2011 | Final Value of Variable After Performing Operations | Link | Link |
2235 | Add Two Integers | Link | Link |
2413 | Smallest Even Multiple | Link | Link |
2469 | Convert the Temperature | Link | Link |
Contributions to this repository are welcome. If you would like to contribute a solution, please make sure to follow the contribution guidelines.
Please ensure that your contributions adhere to our code of conduct.
This project is licensed under the terms of the MIT license. See the LICENSE file for details.