- Sum of n series. For example: input: 7, output:
1
1 1
2 1
1 2 1 1
1 1 1 2 2 1
3 1 2 2 1 1
1 3 1 1 2 2 2 1
- Multiplication table. Prints a multiplication table in this format:
1*1=1 2*1=2 3*1=3
1*2=2 2*2=4 3*2=6
...
4*1=4 5*1=5 6*1=6
4*2=8 5*2=10 6*2=12
...
7*1=7 8*1=8 9*1=9
7*2=14 8*2=16 9*2=18.
...
7*9=63 8*9=72 9*9=81
- Roman numeral converter to Integer.
I - 1
V - 5
X - 10
L - 50
C - 100
D - 500
M - 1000
| Roman Numeral | Number | Explanation |
|---|---|---|
| I | 1 | |
| VI | 6 | 5 + 1 |
| LXX | 70 | 50 + 10 + 10 |
| IV | 4 | 5 - 1 |
| XC | 90 | 100 - 10 |
| CM | 900 | 1000 - 10 |
- Find the longest substring without the duplicate characters. Given S only contains lowercase alphabets
| Input | Output |
|---|---|
| abcde | abcde |
| abcdec | dec |
number of island question https://leetcode.com/problems/number-of-provinces/ https://leetcode.com/discuss/interview-question/1184534/amazon-oa-sde2-optimizing-box-weight-gift-grouping https://leetcode.com/discuss/interview-question/1273052/amazon-oa-sde2
friends of friends twisted merge sort priority queue depth first search count of swaps combination sum