Technical Interview Questions

Divya K. - "Explain how you implemented your telemetry and observability in previous projects."See full answer

T I. - "This is due to sticky sessions. The load balancer is not correctly configured with sticky session option. It is likely the servers were storing session data on the server themselves (in-memory), and thus when user makes a request, the load balancer routes this to a different server than the one they started with, that second server may not recognise the user's session. This could prompt the user to log in again. One way to resolve this, is to use a centralised session storage, something like"See full answer

Bit P. - "Testing"See full answer

Exponent - "This is a Technical question. It tests your ability to understand high level technical concepts. Even though your job won't have any coding involved, you'll still need to understand these concepts. Being able to cover all these topics with clarity communicates confidence in your interviewer. Unfortunately, there's no formula for technical questions, but some general tips are: Use analogies when you can Break your solution into clear, bite-size steps Don't be afraid to use examples to b"See full answer

Surbhi G. - "Ensure immediate safety: The first priority is to secure the vehicle and its occupants by stopping the engine, activating hazard lights, and unlocking doors. Assess the situation: The car evaluates the extent of damage, determines its location, and checks on the status of passengers. Call for help: Based on the assessment, the car calls emergency services if necessary and notifies the manufacturer. Collect and store accident data: This is crucial for later analysis and potential legal pu"See full answer

Erjan G. - "i said there is hashed, clustered, non-clustered"See full answer

Tony C. - "That I had not been a PM for a formal ML product. But good models need sound data and my five years of sql writing and ensuring that DWHs and marts had the data they needed for reporting would be very relevant"See full answer

Saurabh S. - "Basic Approach As BST inorder traversal will result in a sequence of increasing order. Store that order in a vector and get the k-1 index to get the Kth smallest element, similarly access the N-K+1 th element will be the Kth largest element Time Complexity: O(n) Space Complexity O(n) Space Optimized Approach For Kth smallest , start inorder traversal, and keep a counter, decrement the counter when you access the node element. When the counter turns 0 that elementwill be the Kth smal"See full answer

Taneesha G. - "Yes"See full answer

Satyam S. - "Binary search is commonly used for searching elements in a sorted array. Most searching algorithms take O(n) time, but binary search operates in O(log(n)) time complexity. function binarySearch(arr, target) { let first = 0; let last = arr.length - 1; // Adjusted to correctly represent the last index while (first target) { last = mid - 1; } "See full answer

Deepak M. - "Imagine there's a new toy you've always wanted, but it's not quite perfect. Maybe it's missing a feature you'd love, or it's a bit too complex to use. That's where a product manager, or PM, comes in! Think of a PM like the captain of a shipbuilding this amazing toy. They work with different teams, like the designers who make it look cool, the engineers who build it, and the marketers who tell everyone about it. They listen to people like you, who use the toy, to understand what they like and wha"See full answer