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.
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.
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.
Given a binary tree, write a code to print the left view of a binary tree.
The left view of a binary tree is the set of visible nodes when the tree is seen from the left side.
Find Square Root of an Integer. How to calculate square root in java without sqrt function.
Given an integer x (non-negative integer). Write a code to compute the square root of x.
If x is not a perfect square in that case return floor of square root of x (floor(sqrt(x))).
NOTE: Do not use the sqrt function from the standard library.
For example –
Example 1:
Input: 4
Output: 2
Example 2:
Input: 11
Output: 3
The square root of 11 is 3.316624 but we have returned the integer part only after truncating the decimal digits.
floor(3.316624) is 3
Example 3:
Input: 17
Output: 4
The square root of 17 is 4.12310. Floor(4.12310) is 4.