• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

May 10, 2015 by Dhaval Dave

Set of Numbers are given to you.
convert them to Roman numbers.
Solution is in Hacker Earth style

static String[] romanizer(int[] num) {
	String ans[] = new String[num.length];
	for(int i=0; i<num.length;i++){ 			
           ans[i]=convertToRoman(num[i]); 		
        }
        return ans; 	
}
static String convertToRoman(int val){                
          String res=""; 
          String huns[] = {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"}; 	    
          String tens[] = {"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"}; 	    
          String ones[] = {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"}; 	     	    
          int   size[] = { 0,   1,    2,     3,    2,   1,  2,      3,       4,     2}; 	

          while (val >= 1000) {
	         res=res+'M';
	         val -= 1000;
	  }
	  
	  res=res+huns[val/100];
	  val = val % 100;
	  
          res=res+ tens[val/10];  
	  val = val % 10;
	  
          res=res+ ones[val];
	  return res;
	}

Similar Articles

Filed Under: Adobe Interview Questions, Amazon Interview Question, Flipkart Interview Questions, Hacker Earth Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Mathematical, string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

BFS (Breath First Search)

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Possible sizes of bus to carry n groups of friends

Level order traversal in Spiral form

LeetCode: Binary Tree Maximum Path Sum

Calculate price of parking from parking start end time prices

Find two non repeating elements in an array of repeating elements

Handle duplicates in Binary Search Tree

Maximum of all subarrays of size k

Given a string, find the first character which is non-repetitive

Amazon Interview On-Campus For Internship – 1

Count number of ways to reach a given score in a game

Print Power Set of a Set

Find min element in Sorted Rotated Array (Without Duplicates)

Linked List V/S Binary Search Tree

Minimum insertions to form a palindrome

Search element in a matrix with all rows and columns in sorted order

Diagonal Traversal of Binary Tree

1014 Practice Question of New GRE – Princeton

C Program for TAIL command of UNIX

Stock Buy Sell to Maximize Profit

Spanning Tree

Get K Max and Delete K Max in stream of incoming integers

K’th Largest Element in BST when modification to BST is not allowed

Urban Ladder Written Test.

Flipkart Set 1 On Campus with Answers

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Find next greater number with same set of digits

Maximum difference between two elements s.t larger element appears after the smaller number

Check Binary Tree is Binary Search Tree or not

Copyright © 2025 · Genesis Framework · WordPress · Log in