How to solve the question 1 with O(n),O(logn) time complexity
AnswerBot
1y
To solve question 1 with O(n) time complexity, iterate through the array once. To solve with O(logn) time complexity, use binary search.
For O(n) time complexity, iterate through the array once and per...read more
Help your peers!
Add answer anonymously...
Top Oracle Server Technology interview questions & answers
Top HR questions asked in Oracle Server Technology
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
Follow us
