Interview Questions

Anup S. - "1 Billion Matches per day is it over sized ?"See full answer

Eshaa D. - "Design an accessible alternative to airport lounges. Clarifying questions: Is this global international airports or only US focused? - US to start Goal: To provide travelers a more accessible and comfortable travel experience. Users: Disabled / elderly travelers – need physical accessibility and sensory-friendly environments Families with kids Economy travelers – can’t access lounges but still want rest, Wi-Fi, and clean spaces. Business travelers – want work pods, reliabl"See full answer

Dileep D. - "Phishing Attack Scenario (High-Level) Attack Type: Phishing Goal: Steal user credentials Attack Vector: Fake email pretending to be a bank Target: End users Impact: Account takeover, financial loss Detection: Email filtering, user reports Prevention: User awareness training Multi-factor authentication Email security gateways"See full answer

Wizzy B. - "URL> DNS over UDP> IP address > TCP handshake > HTTP(SSL handshake) req, responses, websites architectures for any query DB, servers."See full answer

Abinash S. - "I checked the unittest is giving a False assertion as you can see in the colab notebook below. F FAIL: testsimple (main_.Conv2dTest) Traceback (most recent call last): File "", line 19, in test_simple self.assertTrue(torch.equal(output, torch.tensor([[[[ 5., 1.], [ -2., -10.]]]]))) AssertionError: False is not true"See full answer

Javed S. - "One good reason for using the doubly linked list is that to remove an accessed item in the list from its existing position say in the middle of the list and move it to the head, you need to update the previous node's next pointer and the next node's previous pointer. A singly linked list only has next pointers, so removing from the middle would require traversing from the head to find the previous node which requires O(n) time. A doubly linked list allows O(1) removal from any position because w"See full answer

Prashanth A. - "We are asked to calculate Sum(over value) for time in (t - window_size, t) where key in (key criteria). To develop a function to set this up. Let w be the window size. I would have an observer of some kind note the key-value, and for the first w windows just add the value to a temporary variable in memory if the key meets the key criteria. Then it would delete the oldest value and add the new value if the new key meets the criteria. At each step after "w", we would take the sum / w and store"See full answer

Aelaf G. - "This depends on the list of documents and the length of the documents. My implementation will use Trie with node containing the following: class TrieNode { is_end: boolean, instances: { docid → [wordpositions] }, children: array[26] } Look up for a word will give result instances{docid:wordposition...} dictionary (which can be further improved by methods like max instance on a document....you name it...) Trie space is proportional to the total characters in"See full answer

Madhuri J. - "Clarifying questions Define ride sharing app: An app for people who wish to go from one place to another and they prefer to share the ride with fellow riders who are heading to the common route. This app provides a way to book a shared cab or Auto. Type of rides: Does not include luxury cars We are trying to enhance customer experience by ensuring less cancellations from user's side rather then cancellation from driver's side. No timelines involved Need to consider competitors"See full answer

Pranay N. - "Okay, so before we start discussing how to design this platform, I have a few questions I need details on. Clarification Questions: What do you mean by "Podcasting Platform"? Producing a platform and releasing it online takes several steps (Ideation, scripting, equipment selection, recording, editing, choosing a platform to release, etc.). Are we looking at any specific step here? - Free to Assume Am I PM at Google designing a Podcast Platform as a tool inside existing Google Pro"See full answer