Longest Subsequence With Limited Sum

[Ghanshyam-07]

I have added a new problem titled "Rank Transform of an Array" along with its solution. The problem involves finding the array answer of length m where answer[i] is maximum size of a subsequence that you can take from nums such that the sum of its elements is less than or equal to queries[i], where queries and nums are interger array . Utilizing Shorting and Prefix-Sum to optimize the solution. I request you to add it to the repository, followed all the guideline correctly.