Introduction to Microservice Architecture Using SpringBoot - Part 1

Q1)  Kth smallest element

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.

Example 1:

Input:
N = 6
arr[] = 7 10 4 3 20 15
K = 3
Output : 7
Explanation :
3rd smallest element in the given 
array is 7.

Example 2:

Input:
N = 5
arr[] = 7 10 4 20 15
K = 4
Output : 15
Explanation :
4th smallest element in the given 
array is 15.

CODE : -

 // { Driver Code Starts   
 import java.io.*;  
 import java.util.*;  
 class GFG {  
      public static void main (String[] args) {  
           Scanner sc=new Scanner(System.in);  
           PrintWriter out = new PrintWriter(System.out);  
           int t=sc.nextInt();  
           while(t-->0)  
           {  
             int n=sc.nextInt();  
             int arr[]=new int[n];  
             for(int i=0;i<n;i++)  
             arr[i]=sc.nextInt();  
             int k=sc.nextInt();  
             Solution ob = new Solution();  
             out.println(ob.kthSmallest(arr, 0, n-1, k));  
           }  
           out.flush();  
      }  
 }  
 // } Driver Code Ends  
 //User function Template for Java  
 class Solution{  
   public static int kthSmallest(int[] arr, int l, int r, int k)   
   {   
     Arrays.sort(arr);  
     return arr[k-1];  
   }   
 }  

Question Link :-  https://practice.geeksforgeeks.org/problems/kth-smallest-element5635/1#