InterviewBit Problems
Max Min : Solved
About the Max Min : Solved category
(1)
Divide and conquer approach in java
(1)
Two liner solution in C++
(1)
Solution With Minimised Comparisons
(2)
Minimal Comparison Solution
(1)
Easiest Solution by vasu
(1)
Java Code 2 lines easy
(1)
O(n log n) is my best, Any better?
(6)
Just 5 python Lines!
(3)
Easiest c++ solution approach with lowest complexity
(1)
Best Solution , No STL no need of any Fancy Function
(1)
Just two lines of c++ code
(2)
C++ Solution using Divide and Conquer, Time Complexity: O(log n) [CORRECT ME IF I AM WRONG]
(4)
Short C++17 solution
(1)
Easy and small sorted solution c++
(1)
Java Easy to understand Solution -Max Min
(1)
C++ soln using Heap
(1)
Simple code in java
(1)
O(n) solution CPP
(1)
The Fastest solution given in "Complete Solution" is wrong. Here's why (correct me if I'm wrong though)
(2)
Simple O(N) c++solution
(1)
O(3n/2) comparisons
(1)
Simple solution in 2 lines
(1)
Ruby Solution: Complexity Sol1- O(n logn) and Sol2-O(n)
(1)
O(logn) solution using divide and conquer algorithm
(1)
Number of comparisions
(2)
Simple CPP solution O(n)
(5)
I'm afraid my soln is correct..I was not expecting it
(1)
Simplest O(n) solution. 10 lines only
(1)
Python3 Solution - All the Best :)
(1)
next page →