Message on Whatsapp 8879355057 for DSA(OA + Interview) + Fullstack Dev Training + 1-1 Personalized Mentoring to get 10+LPA Job
0 like 0 dislike
625 views
in Online Assessments by Expert (111,530 points) | 625 views

1 Answer

0 like 0 dislike
Best answer

120 min, 2 questions
Q1: https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/
Q2: Given a string consisting of '0'/'1', find the number of palindrome subsequence of length 5.
For Q2 I used O(N) dp.

by Expert (111,530 points)