InterviewBit Problems   Stringoholics : Solved

About the Stringoholics : Solved category (1)
Can you please find out mistake in my code? I have used KMP and LCM using gcd (1)
What is the problem in this code? (Time complexity is not an issue here) (2)
Simple c++ solution without kmp (8)
Even after using KMP the time complexity is O(n^2). For n=10^5 why a O(n^2) solution should be correct? (2)
Wrong Editorial Solution for String having Recurrent Substring (1)
Simple Solution Python3 (1)
If a part of substring repeats, then the given solution should not work (1)
Solution Approach - 2LEN - 1 (3)
What is the error in this? (1)
Please anyone help why my submission is failing. anything wrong in my code? (1)
Cant' Understand what to do? Take LCM or not? (4)
Correct Python Solution (2)
Solution Using KMP and factorisation (1)
Correct Solution using kmp (2)
I think the expected output is incorrect (1)
Some useul links for the solution (1)
Simple code without any GCD or KMP hutiyapa (2)
All Wrong Editorial solutions (2)
Cpp easy solution without using KMP (7)
Perfect and Simple Solution which passes, input aaaa output =1; (2)
String of form AAA (2)
Please explain how we got a repeating substring using KMP (2)
Please explain the editorial solution of java (1)
Please explain the editorial solution of Java ?(rhash,twopow,uphash) (1)
Weird issue in return value for Python 3 (1)
Find the mistake please (1)
Why is this C solution giving wrong result (1)
Make better test cases (1)
Python 3 solution correction (2)