Minimum characters to be added at front to make string palindrome || GeeksforGeeks || POTD

Minimum characters to be added at front to make string palindrome || GeeksforGeeks || POTD
Join us at telegram: telegram.me/placement_phodenge
Twitter : / awasthi__
LinkedIn :
Problem (GFG) : practice.geeksforgeeks.org/pr...
CODE LINK : github.com/Saum112/GFGCodingQ...
#CodingInterview #GFGPractice #GeeksforGeeks #PracticeProblems #CodingQuestions #leetcode #coding #programming #coding #bfs #graphs #graph #djikstra #gfg #programming #coding #dsa #stack #queue #tree #bst #heap #maxheap #dfs #bfs #backtracking #queue #trees

[@mayankrastogi7035]

This logic giving TLE in c++

[@ayushbhandarkar8394]

The above approach is a O(n^2) solution,

[@parzival_rex_1509]

@Study with Saumya , try submitting it.

[@hackcrack4689]

I'm new in dsa and i got your explaination very easily can you please make a video on how to learn dsa like any roadmap...

[@techgianttechyforever]

whats time complexity of your code ?

[@user-fq8wt9wd3m]

TC is O(n^2). if we use KMP algo then TC will O(n).

[@rishabhsinha7250]

This can be solved using LPS array in O(n) time

[@ashwinnair1035]

TLE mam please tell us how to optimize this code

[@rahilsanghavi9347]

Why does the same code in C++ give TLE?

[@anuragsinghal8451]

How can you surely say that answer will be n-(length of LPS)

[@awesome_latest_virals6098]

TLE.......please upload the optimised approach

[@raviprakashyadav3741]

In Video you said- answer will be length of (N - longest palindromic substring).

[@mohdrehan5332]

Time complexity is O(n^2). It will give TLE. :(

[@vijayanks1714]

can any one provide the test case that fail bcz of TLE

[@abhishekkumargupta3605]

Don't you think your code time complexity is O(n^2) in the worst case..

[@prateekramani6491]

How easily u solved this question is Amazing !!

[@kushagrasinghsisodia9380]

TLE this solution is not optimised

[@jagadishkilli835]

Carryon mam like this... It will help us a lot.. And thnq so much mam

[@ShivamSingh-ne3en]

i watched 4 to 5 videos on this problem but i was not satisfied with the solutions there or they seemed difficult but now i am satisfied..best explanation👍

[@user-ys3bm3yh6q]

Aap bhee striver ke student ho ?:I hope u all are doing extremely well !!