Given an n x n matrix, where every row and column is sorted in increasing order, how do you decide whether a given number x is in the matrix with linear time complexity?
AnswerBot
2y
Algorithm to find if a number is present in a sorted n x n matrix with linear time complexity.
Start with the top right element
Compare the element with x
If equal, return its position
If e < x, move down...read more
Help your peers!
Add answer anonymously...
Directi Software Engineer interview questions & answers
A Software Engineer was asked Q. Given a rectangle of size M x N, and a set of smaller rectangles of sizes M1 x N...read more
A Software Engineer was asked Q. Glasses are stacked like a pyramid. Given X liters of water to pour on the topmo...read more
A Software Engineer was asked Q. Given the transformation rules A - AB and B - BA, and starting with A, how many ...read more
Popular interview questions of Software Engineer
A Software Engineer was asked Q1. Given a rectangle of size M x N, and a set of smaller rectangles of sizes M1 x N...read more
A Software Engineer was asked Q2. Glasses are stacked like a pyramid. Given X liters of water to pour on the topmo...read more
A Software Engineer was asked Q3. Given the transformation rules A - AB and B - BA, and starting with A, how many ...read more
Stay ahead in your career. Get AmbitionBox app
Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2025 Info Edge (India) Ltd.
Follow Us
