In this video, we are solving a **Java coding interview question reported from a recent Infosys Java Developer interview**.
The coding question is:
*Find the Saddle Point in a Matrix using Java.*
A Saddle Point is an element that is **maximum in its row and minimum in its column**.
In this video, I will explain the problem step by step and implement the complete solution practically in **Java using STS (Spring Tool Suite)**.
What you will learn
What is a Saddle Point?
How to identify a Saddle Point in a matrix
Step-by-step approach to solve the problem
Java implementation
Dry run with a sample input
Time and space complexity
What happens when there is no Saddle Point?
Possible interview follow-up questions
How to improve your problem-solving approach for Java interviews
Example
Input:
3 2 1
4 5 6
7 8 9
Output:
Saddle Point: 3
Because `3` is the maximum element in its row and the minimum element in its column.
This type of coding problem is useful for **Java Developer interviews, backend developer interviews, and experienced Java professionals preparing for technical rounds**.
If you are preparing for **Infosys, TCS, Wipro, Capgemini, LTI Mindtree, Cognizant, Accenture, Amazon or other Java Developer interviews**, make sure you practice these coding patterns rather than simply memorizing solutions.
*Subscribe to the channel* for more Java coding interview questions, Java 8/17/21 concepts, Spring Boot, Microservices and real-world Java interview preparation.
#Java #JavaInterview #JavaCoding #InfosysInterview #JavaDeveloper #CodingInterview #JavaProgramming #SpringBoot #BackendDeveloper #Java17 #InterviewPreparation #CodingQuestions #javaisawesome
On this page of the site you can watch the video online Infosys Java Interview Coding Question 2026 | Find Saddle Point Using Java with a duration of hours minute second in good quality, which was uploaded by the user Java is Awesome 22 August 2026, share the link with friends and acquaintances, this video has already been watched 305 times on youtube and it was liked by 6 viewers. Enjoy your viewing!