InterviewBit Problems
Longest Palindromic Substring : Solved
O(N^2) simple iterative soln with 0(1) space without DP
(1)
Dirty Python3 solution
(1)
C++ Simple Solution to Understand
(2)
Dynamic programming solution gives segmentation fault. Can someone fix this?
(2)
Manacher's Algorithm in C++ [ O(N) Time complexity ]
(1)
Easy C++ dp solution
(1)
O(N^2) solution with O(N) space complexity C++ solution using dynamic programming
(1)
Just A Hint for the question
(1)
Palindrome in Python
(1)
Correct code still giving incorrect output
(1)
Here's my easy to understand C++ solution
(1)
C++ O(n*n) Solution in O(1) Memory
(1)
O(N^2) time and O(1) space
(2)
Manacher's Algo in Java : O(n)
(1)
Used modified lps of kmp algorithm
(2)
O(n) solution with manacher's algo
(2)
Why O(1) space if using slicing in python2.7 solution
(1)
Can someone explain the codes time complexity.I think it is O(n^2) but its getting timed out
(1)
What the hell Manachar algo gives wrong but on manual testing says it's correct i hate interviewbit
(1)
Stack over flow with recursive approach
(1)
Solve using reverse string approach
(1)
Bruteforce solution (O(n^3) time) is getting accepted :( Please fix it
(1)
Checking is not correct
(1)
Why was second condition needed?
(1)
Runtime Error when using a function
(1)
Brute force is also acceplable :( Please, fix it. bool isP(const string& a,
(3)
← previous page
next page →