fbpx

Palindrome

Is this the toughest C++ interview question? Palindrome with strings using O[n^2]

Is this the toughest C++ interview question? Palindrome with strings using O[n^2] This could easily one of the hardest questions you could be asked in an advanced senior level C++ interview. Here are two attempts o[n^2] #include using namespace std; void longestPalindrome(char *str, int n) { int i=0; int j=0; int start = 0; int …

Is this the toughest C++ interview question? Palindrome with strings using O[n^2] Read More »

NOTE!

Check NEW site on stock forex and ETF analysis and automation

Scroll to Top