Welcome to the LeetCode-Top-50 repository! Here you can find solutions to various LeetCode problems, focusing on the top 50 most frequently asked questions. Below is a brief overview of the files available in this repository:
-
Two Sum.js
- Implementation of the Two Sum problem.
-
3Sum.js
- Solution for the 3Sum problem with additional lines added recently.
-
3Sum Closest.js
- Calculates the closest sum of three elements in an array.
-
4Sum.js
- Computes the sum of odd keys in an array.
-
Next Permutation.js
- Updated code for generating the next permutation.
-
Median of Two Sorted Arrays.js
- Added functionality to find the median of two sorted arrays.
-
Permutations.js
- Updated solution for generating permutations.
-
Longest Palindromic Substring.js
- Computes the longest palindromic substring in a string.
-
Pow(x, n).js
- Added code to compute the power of a number.
-
Reverse Integer.js
- New implementation for reversing an integer.
-
String to Integer (atoi).js
- Implements the atoi function to convert a string to an integer.
-
Palindrome Number.js
- Added code for checking if a number is a palindrome.
-
Tricky Array SumOfOddKeys.js
- Calculates the sum of odd keys in an array.
-
Tricky Array SumOfOddKeys.py
- Python implementation for calculating the sum of odd keys in an array.
-
launch.json
- File related to project configuration.
-
README
- Initial commit README file.
Feel free to explore these solutions and contribute by adding more efficient or alternative approaches! If you have any questions or suggestions, please don't hesitate to reach out. Happy coding!