Programming Question: Leetcode — 12

  1. This question is quite easy to solve , we just have to declare mappings properly .
  2. After that, we will loop through the mapping and keep decrementing number if it exists in mapping and simultaneously adding corresponding roman into the result.
  3. return the result in end

--

--

--

!Engineer

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Developing others as a software engineer

Ansible and Jenkins — automate your scritps

Default function parameter

Create better code using delegates and extension methods in Unity

Apple Wallet Passes in Salesforce1

Stripe Custom Form in Vanilla JS

Programming Your Application

Drupal Agency Working Remotely

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Raj shukla

Raj shukla

!Engineer

More from Medium

[Leetcode 525] Contiguous Array

How to perform range addition in O(n) time and O(1) space complexity?

LeetCode 843. Guess the Word

Sort Array By Parity — LeetCode