DE Shaw Senior Member Technical Interview Questions and Answers

There were 2 Questions in the Hackerrank Test
1. DP (Leetcode Hard)
2. Arrays (Medium)

Was able to solve almost 1 Question Completely, Second question with 80% Test Cases.

Q1. Arrays Medium (Increasing Triplet Subsequence - Leetcode )
Add your answer
Q2. DP Hard ( Minimum Steps to Delete a String by deleting substring comprising of same characters - GFG)
Ans. 
The problem involves finding the minimum steps to delete a substring comprising of same characters from a given string.
• Use dynamic programming to keep track of the minimum steps required to delete substrings.

• Iterate through the string and check for substrings with same characters.

• Update the DP array with the minimum steps required to delete the substring.
Answered by AI
Add your answer

Q1. Leetcode hard dp on tree. Could be solved using greedy. 1 LLD of uber Be havouor
Add your answer