GitHunt
YO

Yonghee9106/leetcode-solutions

with optimized complexity and detailed comments

algorithmscoding-challengesjavajavascriptleetcodeleetcode-javaleetcode-java-solutionsleetcode-javascriptleetcode-javascript-solutionsleetcode-pythonleetcode-python3-solutionsleetcode-solutionspython

Yonghee's Leetcode Solutions

# Title Solutions Difficulty Complexity
1 Two Sum Java, JavaScript, Python Easy $O(n)$
2 Add Two Numbers Java, JavaScript, Python Medium $O(max(m,n))$
3 Longest Substring Without Repeating Characters Java, JavaScript, Python Medium $O(n)$
4 Median of Two Sorted Arrays Java, JavaScript, Python Hard $O(log(min(m,n)))$
5 Longest Palindromic Substring Java, JavaScript, Python Medium $O(n^2)$
6 Zigzag Conversion Java, JavaScript, Python Medium $O(n)$
7 Reverse Integer Java, JavaScript, Python Medium $O(log(x))$
8 String to Integer (atoi) Medium

Languages

Python40.8%Java34.2%JavaScript25.0%

Contributors

YO
Created February 27, 2021
Updated August 6, 2024
Yonghee9106/leetcode-solutions | GitHunt