![]() |
Hi everyone! I am writing this post to share my interview experience at D.E. Shaw interview, I applied for a summer internship through my on-campus recruitment process, so let’s start with the process There were in total of 4 rounds
So the first round was a bit clear there were in total of 3 questions and each question was time bound question which first question had 25 min while the rest two had 35 min to solve, the first question was related to the simple map, the second was partition dp question and the third was related to Floyd Warshall algorithm based on the graph, I was able to solve first 2 and passed half of the test cases in the third question, hence shortlisted for interview process of D.E. Shaw Lets. jump to interview round – In the first round, I was asked about 3 questions based on Arrays and there was a time of 45 minutes, let’s discuss those questions. So the first question was you are given an array that contains only two types of characters ‘a’ and ‘b’ and I need to count all those subarrays that contain an equal number of ‘a’ and ‘b’ The second question was you are given an array of 0 and 1 and I need to count the total number of subarrays that contain only a single ‘1’ The third question was a direct leetcode question i will add that later if I find that question I was able to solve the first two of them But was not able to made to second round of interview, Hence not shortlisted for the role That’s all from my side Hope you made it into the company! |
Reffered: https://www.geeksforgeeks.org
Experiences |
Type: | Geek |
Category: | Coding |
Sub Category: | Tutorial |
Uploaded by: | Admin |
Views: | 11 |