Filter interviews by
To find the maximum length BST in a given binary tree.
Traverse the tree in post-order fashion
For each node, check if it satisfies the BST property
If it does, calculate the size of the BST rooted at that node
Keep track of the maximum size seen so far
Algorithm to find absolute max subsequence of an array with positive and negative numbers in O(n) time.
Initialize max_so_far and max_ending_here as 0
Loop through the array and for each element, add it to max_ending_here
If max_ending_here becomes negative, reset it to 0
If max_ending_here is greater than max_so_far, update max_so_far
Return max_so_far
Eliminate duplicates in an array of strings and print it in linear time complexity.
Use a hash set to keep track of unique elements
Iterate through the array and add non-duplicate elements to the hash set
Print the hash set elements to get the final array
Balancing of Btrees / AVL trees is important for efficient search and insertion operations.
Btrees and AVL trees are self-balancing binary search trees.
Balancing ensures that the height of the tree is minimized, leading to faster search and insertion operations.
Btrees are used in databases while AVL trees are used in memory.
Balancing is achieved by performing rotations and node splitting.
AVL trees have a stricter balanc...
139 teams in a knock-out tournament, find the number of matches to choose the champion.
In a knock-out tournament, each team plays only one match per round.
The number of matches required to choose the champion is one less than the number of teams.
Therefore, the number of matches required is 138.
My resume includes projects such as a web-based inventory management system and a mobile app for tracking fitness goals.
Developed a web-based inventory management system using PHP and MySQL
Created a mobile app for tracking fitness goals using React Native
Implemented RESTful APIs for communication between front-end and back-end
Utilized version control tools such as Git for collaborative development
Designed and implement...
Algorithm to mirror a given Binary Tree
Create a function to swap left and right child nodes of a given node
Recursively call the function on left and right child nodes
Base case: if node is null, return
Call the function on the root node of the binary tree
Find the next largest int with same number of 1's in binary.
Count the number of 1's in the binary representation of the given int.
Increment the given int until a number with the same number of 1's is found.
Return the next largest int with same number of 1's.
I am a dedicated and experienced professional with a strong background in project management and team leadership.
Over 10 years of experience in project management
Proven track record of successfully leading cross-functional teams
Strong communication and interpersonal skills
Certified in project management (PMP)
Previously managed a project with a budget of $1 million
TDS stands for Tax Deducted at Source, a system where tax is deducted by the payer at the time of making payment.
TDS is a system introduced by the Income Tax Department of India to collect tax at the source from where an individual's income is generated.
It is applicable to various payments such as salary, interest, commission, rent, etc.
The deducted TDS amount is then deposited to the government by the deductor.
TDS rat...
GST on reverse charge is a mechanism where the recipient of the goods/services is liable to pay the tax instead of the supplier.
Under reverse charge mechanism, the recipient of the goods/services is responsible for paying the GST instead of the supplier.
It is applicable in certain cases like import of services, specified goods/services, etc.
The recipient needs to self-assess and pay the tax directly to the government.
I...
Documents required for foreign remittance include identification proof, proof of address, and purpose of remittance.
Identification proof such as passport or driver's license
Proof of address like utility bill or bank statement
Purpose of remittance document like invoice or agreement
I was interviewed in Aug 2024.
I applied via Campus Placement and was interviewed in Sep 2024. There were 3 interview rounds.
2 Coding questions - medium to hard
Implement LFU cache using OOPs concepts
Create a class for LFU cache with methods like get, put, and remove
Use a hashmap to store key-value pairs and a hashmap to store frequency of each key
Implement a doubly linked list to store keys with the same frequency
DE Shaw interview questions for popular designations
Group list of strings as anagrams and return the list.
Create a hashmap to store sorted strings as keys and list of anagrams as values
Iterate through the list of strings, sort each string and add it to the corresponding list in the hashmap
Return the values of the hashmap as the grouped anagrams
Get interview-ready with Top DE Shaw Interview Questions
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
I applied via LinkedIn and was interviewed in Sep 2024. There were 3 interview rounds.
2hour test comprising of quant, reasoning and behavioral question.
Design a zepto delivery system for efficient and fast delivery of small packages.
Utilize drones for quick and efficient delivery
Implement a centralized hub for package sorting and distribution
Use GPS tracking for real-time package monitoring
Optimize routes for faster delivery times
Ensure secure and reliable delivery process
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
Binary Search & Dynamic Programming
Projects and queries involve understanding and working on various software projects and related inquiries.
Projects involve developing, testing, and maintaining software applications.
Queries may include troubleshooting issues, optimizing performance, and implementing new features.
Examples of queries include debugging a software bug, improving code efficiency, and integrating a new API.
How and when will India become a 5 trillion dollar economy?
Ensure scalability in system design by using horizontal scaling, load balancing, caching, and microservices architecture.
Implement horizontal scaling to add more servers to handle increased load.
Use load balancing to distribute incoming traffic across multiple servers.
Utilize caching to store frequently accessed data and reduce database load.
Adopt microservices architecture to break down the system into smaller, indepe
Design a distributed trading system platform
Utilize microservices architecture for scalability and fault tolerance
Implement message queues for asynchronous communication between components
Use distributed databases for data storage and retrieval
Implement load balancing and auto-scaling for handling varying loads
Ensure security measures such as encryption and authentication are in place
Top trending discussions
Some of the top questions asked at the DE Shaw interview -
The duration of DE Shaw interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 77 interviews
Interview experience
based on 154 reviews
Rating in categories
Analyst
165
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
146
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
73
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Lead
53
salaries
| ₹0 L/yr - ₹0 L/yr |
Member Technical Staff
48
salaries
| ₹0 L/yr - ₹0 L/yr |
Goldman Sachs
Morgan Stanley
Citadel
Blackrock