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.
Count Distinct Elements in Every Window of Size K.
Given an array of n integers and an integer k (k is always smaller or equal to n). Return the count of distinct elements in all windows (or in all sub-arrays) of size k.
For example –
Example 1:
Input: {1, 5, 9, 3, 3, 7, 3}, k = 3
Output: {3, 3, 2, 2, 2}
1st window {1, 5, 9}, Distinct elements are 3.
2nd window {5, 9, 3}, Distinct elements are 3.
3rd window {9, 3, 3}, Distinct elements are 2.
4th window {3, 3, 7}, Distinct elements are 2.
5th window {3, 7, 3}, Distinct elements are 2.
Example 2:
Input: {1, 4, 7, 7}, k = 2
Output: {2, 2, 1}
1st window {1, 4}, Distinct elements are 2.
2nd window {4, 7}, Distinct elements are 2.
3rd window {7, 7}, Distinct elements are 1.