As I practice and challenge myself through coding questions from Leetcode, I wanted to create a repository of my steps and explanations through each question. Therefore, each notebook will be individually linked below as they are available.
If you need assistance with any of the questions I have yet to publish, please email green.milok@gmail.com with the problem you are facing, and I would be happy to work through it.
Happy coding,
Milo
- Palindrome Number
- Given an integer x, return true if x is a palindrome, and false otherwise.
- Roman to Integer
- Given a roman numeral, convert it to an integer.
- Longest Common Prefix
- Write a function to find the longest common prefix string amongst an array of strings.
- Valid Parentheses
- Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.