#Day227 of #250DaysOfDSA
Topics and Learnings: #KMPAlgorithm, #String
Problem Revised:
64. #LeetCode #214 : Shortest Palindrome
Approach:
Used Knuth–Morris–Pratt algorithm to solve this
Complexity Analysis:
TC: O(N)
SC: O(N)
#Day226 of #250DaysOfDSA
Topics and Learnings: #KMPAlgorithm, #String
Problem Revised:
63. #LeetCode #1392 : Longest Happy Prefix
Approach:
Used Knuth–Morris–Pratt algorithm to solve this
Complexity Analysis:
TC: O(N)
SC: O(N)
#Day210 of #250DaysOfDSA
Topics and Learnings: #KMPAlgorithm, #String
Problem Solved:
180. #LeetCode #214 : Shortest Palindrome
Approach:
Used Knuth–Morris–Pratt algorithm to solve this
Complexity Analysis:
TC: O(N)
SC: O(N)
#Day209 of #250DaysOfDSA
Topics and Learnings: #KMPAlgorithm, #String
Problem Solved:
179. #LeetCode #1392 : Longest Happy Prefix
Approach:
Used Knuth–Morris–Pratt algorithm to solve this
Complexity Analysis:
TC: O(N)
SC: O(N)
🚀 Day 19 of #GFG160 Challenge Conquered!
🔐 Problem: Minimum Characters to Make a String Palindrome ✨
Unlocked efficiency with the power of KMP — matched smartly, avoided brute force, and made every step count.
#GeekStreak2025#KMPAlgorithm#CodeSmartNotHard@geeksforgeeks🔥
Day 18 of 160 Days, 160 Problems—GFG Challenge. Solved the Problem to Implement the Knuth-Morris-Pratt (KMP) Algorithm to efficiently find all occurrences of a pattern in a string using the LPS array.
#GeeksForGeeks#160DaysChallenge#geekstreak2024#gfg160#KMPAlgorithm