Round 1 on April 12,2020\n\nFirst Round was a Coding round which included 2 coding Questions both medium type and 40 Aptitute Questions which were really hard to answer.\nPlatForm _ Hakerrank\n1-Find number of substrings in a string which contains \'a\',\'b\',\'c\' \nhttps://leetcode.com/problems/number-of-substrings-containing-all-three-characters/\n2- 2nd Question was related to graph which could be solved using BFS and DFS\n\nAptitude Questions were really HardTotal 40 Questions \n \n1- 20 Technical which covers areas like SQL,Networking, OS ,Threading, BigO Complexity etc\n2- 20 Logical which was based on Probability,Permutation and Logical Questions like in JEE Mains.\n\nRound 2 - Code Pair on April 19,2020\nPlat_Form Hakerrank\n\nThis Round was online Coding and Interview Round in which you have to solve some Coding Questions in front of Interviewer and present the best optimal solution \n\nQuestions 1- Create Copy of a binary tree with a extra random pointer to any of its node\n I solved it using HashMap using O(N) time complexity but the interviewer wants O(log(N))\nYou first have to create a tree copy with left and right child storing mapping of old pointer to new one  using HashMap and then map the random pointer in the new tree.\nhttps://iq.opengenus.org/copy-a-binary-tree-with-random-pointers/\nQusetion 2-\nDelete all element in linked list whose value is less than x\nThis was an easy one and you can easily pass all test cases\nhttps://www.***.org/delete-all-the-nodes-from-the-list-which-are-less-than-k/\n\nTechnical Questions\n\n1- Garbage Collector in Java\n2- Why we use static in Java\n3-How HashMap are Implemented\n\n\nI was able to answer but lacked better presentaion and provide optimal solution for the first Question.\n\nRound 3   - May,03,2020\n\nPlatform-hakerRank\nAgain a Coding Round and some Aptitute Questions\nThis time the Questions were really hard on topics like Universe has n Infinity stones,In Game of thrones Starks rule over Winterfell and on low rainfall country is facing drought problem and employees have decided for donation.\nThey were even harder than google kickstart  Round C 2020\nIt was very difficult to understand the meaning of the questions as they were twisted in some way.\nAptitute was easy containing questions on dbms,sql and coding concepts.\n\nThis was my last round of Interview in DE Shaw Offcampus.

Round 1 on April 12,2020\n\nFirst Round was a Coding round which included 2 coding Questions both medium type and 40 Aptitute Questions which were really hard t