Last Stone Weight

By | | , ,
Leave a comment

Given a collection of stones, each stone has a positive integer weight. Each turn, we choose the two heaviest stones and smash them together.

Suppose the stones have weights x and y with x <= y.  The result of this smash is:

If x == y, both stones are totally destroyed.

If x != y, the stone of weight x is totally destroyed, and the stone of weight y has new weight y-x.

At the end, there is at most 1 stone left.  Return the weight of this stone (or 0 if there are no stones left.)

For Example –

Input: {2, 7, 4, 1, 8, 1}, Output: 1

Explanation: 

We combine 7 and 8 to get 1 so the array converts to {2, 4, 1, 1, 1} then,

we combine 2 and 4 to get 2 so the array converts to {2, 1, 1, 1} then,

we combine 2 and 1 to get 1 so the array converts to {1, 1, 1} then,

we combine 1 and 1 to get 0 so the array converts to {1} then that’s the value of last stone.

→

Convert Integer to Roman Numeral

By | | , ,
Leave a comment

In this tutorial, I am going to discuss how to convert integer to roman numeral.

Given an integer, Write a code to convert it to a Roman numeral.

What is roman numeral?

Roman numerals are represented by seven different letters (I, V, X, L, C, D, M). These seven letters are used to make thousand of numbers.

Roman Numerals Symbol and It's decimal value.

Example 1 –

Input  : 2, Output : II

Example 2 –

Input  : 11, Output : XI

Example 3 – 

Input  : 6, Output : VI

Example 4 – 

Input : 57, Output: LVII

NOTE – Range of input should be from 1 to 3999.

→