How should I practice Array Rank Transform?

Start by reading the full statement, solve the visible examples, then compare the pattern against related TCS online assessment problems in FastPrep.

Is Array Rank Transform associated with TCS?

FastPrep tags this as a TCS coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · Array

● EasyTCSOA

You are given an integer array arr. Replace each value with its rank after sorting all distinct values in increasing order.

The smallest distinct value has rank 1. Equal values must receive the same rank, and ranks must be consecutive with no gaps.

Return the transformed array in the original order.

arrayRankTransform(arr: int[]) → int[]

arr = [40,10,20,30]return = [4,1,2,3]

The sorted distinct values are 10,20,30,40, so their ranks are 1,2,3,4.

arr = [100,100,100]return = [1,1,1]

All values are equal, so all positions receive the same smallest rank.