Initially, I have told him a brute-force approach of O(n). He asked for optimization. Then I have given a binary search approach. He agreed to that and asked me to write code for that. I had written t...read more

import java.util.Scanner ;

public class Main {

public static void main(String[] args) {

// Write your code here

int i = 1 , result =1 ;

Scanner s = new Scanner(System.in);

int N = s.nextInt();

while(result<=N) {

i++ ;

result = i*i ;

}

System.out.println( i- 1 );

}

}