# Binary Tree Inorder Traversal | Leetcode #94 | Medium

## Problem:

`Input: root = [1,null,2,3]Output: [1,3,2]`
`Input: root = []Output: []`
`Input: root = Output: `

# Remove Duplicates from Sorted List | Leetcode #83 | Easy

## Problem:

`Input: head = [1,1,2]Output: [1,2]`

# Climbing Stairs | Leetcode #70 | Easy

## Problem:

`Input: n = 2Output: 2Explanation: There are two ways to climb to the top.1. 1 step + 1 step2. 2 steps`
`Input: n = 3Output: 3Explanation: There are three ways to climb to the top.1. 1 step + 1 step + 1 step2…`

# Plus One | Leetcode #66 | Easy

## Problem:

`Input: digits = [1,2,3]Output: [1,2,4]Explanation: The array represents the integer 123.`
`Input: digits = [4,3,2,1]Output: [4,3,2,2]Explanation: The array represents the integer…`

# Length of Last Word | Leetcode #58 | Easy

## Problem:

`Input: s = "Hello World"Output: 5`
`Input: s = " "Output: 0`
• `1 <= s.length <= 104`
• `s` consists of only English letters and spaces `' '`.

# Merge Two Sorted Lists | Leetcode #21 | Easy

## Problem:

`Input: l1 = [1,2,4], l2 = [1,3,4]Output: [1,1,2,3,4,4]`
`Input: l1 = [], l2 = []Output: []`
`Input: l1 = [], l2 = Output: `
• The number of nodes in both lists is in the range `[0, 50]`.
• `-100 <= Node.val <= 100`
• Both `l1` and `l2`

# Valid Parentheses | Leetcode #20 | Easy

## Problem:

1. Open brackets must be closed by the same type of brackets.
2. Open brackets must be closed in the correct order.
`Input: s = "()"Output: true`
`Input: s = "()[]{}"Output: true`
`Input: s = "(]"Output: false`
`Input: s = "([)]"Output: false`
`Input: s =…`

# Longest Common Prefix | Leetcode #14 | Easy

## Problem:

`Input: strs = ["flower","flow","flight"]Output: "fl"`
`Input: strs = ["dog","racecar","car"]Output: ""Explanation: There is no common prefix among the input strings.`
• `0 <= strs.length <= 200`
• `0 <= strs[i].length <= 200`
• `strs[i]` consists of only lower-case English letters.

## Solution:

1. If the input array of strings is empty… ## Rishikesh Dhokare

I am a Software Engineer from India and working in Berlin, Germany. I write about technology, my experiences in Germany, travel in Europe.