InterviewBit Problems
All Factors : Solved
About the All Factors : Solved category
(1)
C++ solution without using sorting algorithm.Time complexity O(sqrt(n))
(1)
C++ solution without using sort
(1)
Javascript solution using Math.sqrt and Array.unshift
(2)
Solution with explanation(Passed all the test cases)
(1)
Simple Java Code Solution
(1)
C++ easy to understand solution with TC: O(sqrt(A))
(1)
Java Easy o(sqrt(n)) solution
(1)
Please help me with code. Python Getting error
(2)
How is this solution getting accepted?
(2)
Python (avoiding sort)
(1)
Simple C++ O(sqrt(A)) solution
(1)
Java Solution: using temp list to hold the bigger con-factors and appending them back in reverse order
(1)
This solution is of O(sqrt(N)) time complexity and without using "reverse" function for temporary array. How can I improvise it more?
(1)
C++ O(sqrt(A)) Solution
(1)
Solution with sorting C++
(1)
Why does brute force sol(O(n) or O(n/2)) exceed time limit but when we add all elements from one list to another it doesn't?
(1)
Simple C++ solution in O(log(sqrt(n))) & no sorting
(1)
O(n log n) solution
(2)
Python code O(sqrt(n)) solution
(1)
O(sqrt(N)) Python solution
(1)
Python simple program
(1)
Simple C++ solution without sorting
(1)
Tried writingg the code using 1st type of algorithm of the video
(1)
O(sqrt(n)) solution
(1)
Would'nt sorting taking more time like O(n log n) ? Then rather than sorting the
(3)
Python: don't sort!
(1)
Python easy to understand solution
(1)
A O(n) solution without using sort but using some extra space
(1)
Logarithmic solution
(2)
next page →