• 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

Given a sorted array and a number x, find the pair in array whose sum is closest to x

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

Subset Sum Problem Dynamic programming

Convert number to words java

Walmart Labs Interview Experience

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Maximum size of square sub matrix with all 1’s in a binary matrix

Get Minimum element in O(1) from input numbers or Stack

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

flattens 2 D linked list to a single sorted link list

Serialise Deserialise N-ary Tree

FizzBuzz Solution C C++

Binary Tree Isomorphic to each other

Memory Efficient LinkedList

Code Chef PRGIFT Solution

Common Ancestor in a Binary Tree or Binary Search Tree

The Magic HackerEarth Nirvana solutions Hiring Challenge

Minimum insertions to form a palindrome

The greedy coins game Dynamic Programming

SAP Hiring Off-Campus General Aptitude

Stock Buy Sell to Maximize Profit

Diagonal Traversal of Binary Tree

simple sql injection

Facebook Interview Question : Interleave List

Maximum path sum between two leaves

Check if an array has duplicate numbers in O(n) time and O(1) space

Test Cases for Round Function

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

Binary Tree in Java

Print all nodes that are at distance k from a leaf node

Copyright © 2026 · Genesis Framework · WordPress · Log in