#leetcode-solution
Read more stories on Hashnode
Articles with this tag
An array of parentheses are given. We need to find out if the array contains both opening and closing parentheses or not. Steps: Declare a variable...
After seeing the problem, I determined that iterating the first element of the array and iterating the whole array could be a straightforward approach...
Given a roman numeral, we need to convert it to an integer. After seeing the problem, I thought that I can try with an object to store the roman...
Checking "Palindrome number" is a very widespread problem. Compared to the other languages, I found it easier to solve this problem with...
I previously solved this problem using two for loops. However, that was not a very efficient way to solve this problem. So, this time I solved this...
1. Two Sum Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume...