• 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

Find the element that appears once others appears thrice

Flipkart Set 1 On Campus with Answers

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Coin Collection Dynamic Programming

Reversal of LinkedList

Linked List V/S Binary Search Tree

C++ OOPs Part1

Printing Longest Common Subsequence

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Code Chef PRGIFT Solution

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Memory Efficient LinkedList

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Binary Tree in Java

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

Count Possible Decodings of a given Digit Sequence

Daughter’s Age VeryGood Puzzle

Wrong Directions given find minimum moves so that he can reach to the destination

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

Find next greater number with same set of digits

Max Sum in circularly situated Values

Printing each word reverse in string

FizzBuzz Solution C C++

Sequence Finder Dynamic Programming

Amazon Interview On-Campus For Internship – 1

Find Nearest Minimum number in left side in O(n)

Circular Linked List

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

LeetCode: Container With Most Water

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

Copyright © 2026 · Genesis Framework · WordPress · Log in