Interview questions

46 questions

Find the longest palindromic subsequence using dynamic programming.

TechnicalML Engineer

Can Jump - Given an array of non-negative integers, you're initially at the first index. Each element represents your maximum jump length at that position. Determine if you can reach the last index.

Print all combinations of numbers from 1 to n that sum to n.

Total Outfit Combinations

TechnicalData Science

Serialize and deserialize binary tree

Maximum Number of Non-Overlapping Substrings