InterviewBit Problems   Bulbs : Solved


About the Bulbs : Solved category (1)
Easy peezy recursive code......have a look (1)
Simple & short! (1)
Keeping track of inversion: SImple python solution (1)
Very Easy C++ Solution TC=O(n),SC=O(1) (1)
Easy C++ solution in O(n) TC and O(1) SC (1)
Making use of given condition c++ (1)
Simplest JAVA solution, just 10 lines (1)
Easiest Solution.2.0 (1)
C++ shortest solution ever (1)
Simple O(n) solution : JAVA (1)
Ez C++ Solution (1)
Just find total groups of 1 and 0 (1)
Concise Solution using flips (2)
Python 3 Simple O(n) Solution (1)
Simple O(n) solution using odd and even number of flips (2)
MY new breakthrough with this C++ solution..HAHAHAHAHAHAHA (2)
Isse Easy kuchh nahi c++ (1)
Short 5 lines solution using Bit Tricks in C++ (1)
Here's a short 10 line solution to this problem (1)
A slightly different C++ solution (1)
Easy Python3 Solution(for novice) (1)
Different technique|| o(n) and O(1)|| few line code c++ (1)
O(n) solution in cpp (1)
Easy to understand C Solution O(n) time (2)
We will check if value is not same as previous value. if not then increment the counter and change the value; (1)
Very easy to understand soln, O[n] time, O[1] space (1)
Short and Simple C++ Solutin (1)
Silly Solution, C++, O(n) time, O(1) space (1)
Python 3 O(n) one pass solution (1)