Meesho

3 questions · LeetCode (3)

3 entries

#115 Distinct Subsequences

LeetCode SWE

Question

#115 Distinct Subsequences

#1235 Maximum Profit in Job Scheduling

LeetCode SWE

Question

#1235 Maximum Profit in Job Scheduling

#53 Maximum Subarray

LeetCode SWE

Question

#53 Maximum Subarray

LeetCode Question

#115 Distinct Subsequences

SWE coding Hard

LeetCode #115: Distinct Subsequences. Difficulty: Hard. Topics: String, Dynamic Programming. Asked at Meesho in the last 6 months.

Free preview. Unlock all questions →

String Dynamic Programming