PhonePe OA | NSUT | 17th July 2024

There were 4 problems. time limit- 1.5 hr. These are not the exact problem statements but this is what it simplifies to. 1)  N boxes have to be arranged. Each box can take values from 1 to K. Find the total number of ways of arranging the boxes such that are exactly M pairs where the value of the current box is same as the value of the previous box. Return the answer modulo 1e9+7. 2)  Given a vector of ...