1331. Rank Transform of an Array

Description

The problem involves transforming an array of integers into a new array where each element is replaced by its rank, reflecting its relative size. The ranking system assigns integers starting from 1, with larger elements receiving higher ranks. Notably, identical elements share the same rank, ensuring consistency. The objective is to devise a solution that maintains this ranking hierarchy while keeping the ranks as minimal as possible. This is my first time contributing to an open source project, and I wanted to contribute in a way which I could help.

Put check marks:

Have you made changes in README file ?

• Added problem & solution under correct topic.
• Specified Space & Time complexity.
• Specified difficulty level, tag & Note(if any).

How Has This Been Tested?

Please describe the tests that you ran to verify your changes. Please also note any relevant details for your test configuration.

• I tested it on LeetCode, and it passed all of the testcases.

Make sure all below guidelines are followed else PR will get Reject:

• My code follows the style guidelines of this project
• I have performed a self-review of my own code
• I have commented my code so that it is easy to understand
• I have made corresponding changes to the documentation
• My changes generate no new warnings
• Any dependent changes have been merged and published in downstream modules