import java.util.* ;
import java.io.*; 

public class Solution {
    public static int[] getFloorAndCeil(int[] arr, int n, int target) {
      // Wriute your code here.
       int start=0;
        int end=arr.length-1;
        int ans[]=new int[2];
        int floor=-1;
        int ciel=-1;
        while(start<=end)
        {
            int mid=(start+end)/2;
            if(arr[mid]==target)
            {
                ans[0]=arr[mid];
                ans[1]=arr[mid];
                return ans;
            }
            else if(arr[mid]>target){
                ciel=arr[mid];
                end=mid-1;
            }else{
                floor=arr[mid];
                start=mid+1;
            }

        }
        ans[0]=floor;
        ans[1]=ciel;
        return ans;

    }
    
}
=======================================================================
class Solution {
    public boolean isPerfectSquare(int num)
    {
        int start=0;
        int end=num;
        while(start<=end)
        {
            int mid=(start+end)/2;
            long square=(long)mid*mid;
            if(square==num){
                return true;
            }else if(square>num){
                end=mid-1;
            }else{
                start=mid+1;
            }
        }
        return false;
        
    }
}
==============================================================================