it gives middle number

import java.io.BufferedReader; import java.io.InputStreamReader;

Check all options. First, I checked which one is central, assuming they are all different. Then I checked if they are 2 the same - if so, display any of them And finally I checked if 3 are the same - those that display them, if so.

The following worked for me .Compare both sets of code and check where you went wrong. import java.io.*; public class Solution { public static void main(String[] args) throws Exception { BufferedReader reader = new BufferedReader(new InputStreamReader(System.in)); int a = Integer.parseInt(reader.readLine()); int b = Integer.parseInt(reader.readLine()); int c = Integer.parseInt(reader.readLine()); if (b >= a && c <= a || c >= a && b <= a) System.out.println(a); else if (a >= b && c <= b || c >= b && a <= b ) System.out.println(b); else System.out.println(c); } }

I completed it by importing java.util.Arrays, that way I could use median function. There might be a tidier way to code this but it worked: import java.io.*; import java.util.Arrays; public class Solution { public static void main(String[] args) throws Exception { BufferedReader reader = new BufferedReader(new InputStreamReader(System.in)); String a = reader.readLine(); String b = reader.readLine(); String c = reader.readLine(); int x = Integer.parseInt(a); int y = Integer.parseInt(b); int z = Integer.parseInt(c); int[] values = {x,y,z}; int median = (int) median(values); System.out.println(median); } static double median(int[] values) { Arrays.sort(values); double median; int totalElements = values.length; if (totalElements % 2 == 0) { int sumOfMiddleElements = values[totalElements / 2] + values[totalElements / 2 - 1]; median = ((double) sumOfMiddleElements) / 2; } else { median = (double) values[values.length / 2]; } return median; } }