InterviewBit Problems
Majority Element : Solved
Simple Python3 solution without hashing and O(N) time and O(1) space complexity
(1)
Simplest Hash Map solution. Complexity O(n)
(1)
Hash Map Solution
(1)
Simple O(N) solution using dictionary in python
(1)
Title of your comment Simplest using stack
(1)
C++ O(N) Solution Only ONE PASS
(1)
O(n) solution without extra memory or hashmaps
(1)
O(n) solution using hashmap
(1)
Here my solution for Majority Element [python3]
(1)
3 line solution in C++
(1)
O(nlogn) solution, 2 lines of code
(1)
C++ solution one line!
(1)
C++ O(n) with const space
(1)
Solution doesn't work for this example: [1, 1, 1, 2, 2, 2, 1, 3]
(2)
Is this approach correct?
(1)
O(n) time and O(1) space - better solution
(1)
Very simple and intuitive solution O(n)
(1)
Simple solution using maps
(1)
Solution O(n) Time complexity and O(1) space complexity (assuming majority element always exists)
(4)
Weird object problem . Please help
(2)
Editorial answer in wrong
(2)
Python Solution using counter
(1)
O(n) solution and efficient one
(1)
Learn the correct method
(4)
Python solution in linear time
(1)
Just sort and get the median,no need of greedy
(1)
Something is wrong
(2)
Proposed solution doesn't seem correct
(1)
Editorial solution not passing this test case
(2)
This is what I did - but I got only 392/400 Why?
(1)
← previous page
next page →