6 hours ago · Tech · hide · 0 comments

https://leetcode.com/problems/longest-continuous-increasing-subsequence/ This is an easy problem. Solved it in 1 pass. https://leetcode.com/problems/palindromic-substrings/ I have solved this with brute force - find all substrings and check whether it is a palindrome Further I have tried to optimize this with DP - storing substrings Then found out I can store more efficiently - instead of storing substrings I can store the indices of the substrings Found another approach expand from center for better memory complexity

No comments yet. Log in to reply on the Fediverse. Comments will appear here.