Atlassian | New Graduate | India.

3 questions 90 minutes, platform: HackerRank

The questions were really easy, i was able to solve all 3, the questions go as follows.

Question 1:
Coverst a list of numbers to their Roman numeral form.
https://leetcode.com/problems/integer-to-roman/

Question 2:

Given a list of numbers from 1 to n. find all the good permutations. good permutations are the ones in which arr[j] and arr[j+1] have differenct parity( remainder when divieded by 2).

1<=n<=11 (n = size of the list(array ) ).

Question 3:

Given an array of n elements, select a subsequenece and sort it, when sorted, the difference between the adjacent elements must be either 0 or 1. Return the length of longest such possible subsequence.
1<=n<=10^5. n = no of elements in the array