Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso SFS Financial Services Group (Poona) nel mese di gen 2022
Colloquio
Given an array arr[] and an integer K where K is smaller than size of array, the task is to find the Kth smallest element in the given array. It is given that all array elements are distinct.
Domande di colloquio [1]
Domanda 1
You don't have to read input or print anything. Your task is to complete the