InterviewBit Problems
Vowel and Consonant Substrings! : Solved
About the Vowel and Consonant Substrings! : Solved category
(1)
C++ easy solution O(n)
(2)
Use this approach when this question is asked in your interview
(1)
C++ easy solution. Time=O(n) and space=O(n)
(2)
Simple soloution in python 3
(1)
Simple and clear, understandable solution
(1)
By counting number of Vowels and Consonants : O(|A|) solution C++
(1)
O(|A|) solution by counting number of vowels in prefix
(1)
Simple one line logic
(2)
Check my code please its giving correct output for custom input but giving wrong answer for test cases
(2)
Easy O(n) solution, C++
(1)
Easiest solution possible in c++
(1)
3 line solution
(4)
Easy Solution in O(n) <-- TC and o(1) space complexity cant be easier than this
(1)
C++ solution( using set )
(1)
Simple and Easy O(n) solution
(1)
Simple Solution C++ O(N) Time
(1)
Simple solution in C++ Time O(n)
(3)
Solution O(n) time and O(1) space complexity - Java
(1)
O(n) Simple Solution C++ Easy
(1)
Python Solution Time=O(n)
(1)
Subarry Easy Solution O(n)
(1)
next page →