### Leetcode - Split a String Into the Max Number of Unique Substrings

Problem Statement Given a string s, return the maximum number of unique…

September 13, 2019

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

```
Symbol Value
I 1
V 5
X 10
L 50
C 100
D 500
M 1000
```

For example, two is written as II in Roman numeral, just two one’s added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.

Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

```
I can be placed before V (5) and X (10) to make 4 and 9.
X can be placed before L (50) and C (100) to make 40 and 90.
C can be placed before D (500) and M (1000) to make 400 and 900.
```

Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.

The question looks simple interms that we need to keep mappings. There are three special cases i.e. where subtraction is used.

Lets look at the code:

```
public String intToRoman(int num) {
Map<Integer, String> map = new HashMap();
map.put(1, "I"); map.put(5, "V"); map.put(10, "X");
map.put(50, "L"); map.put(100, "C"); map.put(500, "D"); map.put(1000, "M");
map.put(4, "IV"); map.put(9, "IX"); map.put(40, "XL"); map.put(90, "XC");
map.put(400, "CD"); map.put(900, "CM");
int[] sequence = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
StringBuffer sb = new StringBuffer();
for (int i=0; i<sequence.length; i++) {
int base = sequence[i];
while (num >= base) {
sb.append(map.get(base));
num -= base;
}
}
return sb.toString();
}
```

Problem Statement Given a string s, return the maximum number of unique…

Min Priority Queue is a data structure which manage a list of keys(values). And…

Problem Statement Given a sorted array nums, remove the duplicates in-place such…

Its every software engineer’s dream to work with the big FAANG companies…

Problem The Leetcode file system keeps a log each time some user performs a…

Problem Statement Replace all spaces in a string with ‘%20’ (three characters…

In this post, we will see some of the frequently used concepts/vocabulary in…

System design interview is pretty common these days, specially if you are having…

Introduction You are given an array of integers with size N, and a number K…

Graph Topological Sorting This is a well known problem in graph world…

Problem Statement Given a Binary tree, print out nodes in level order traversal…

Problem Statement Given an array nums of n integers and an integer target, are…