Interview Questions

Sanmitra I. - "BERT is a bidirectional encoder representation transformer. It takes a sequence of tokens and produces vector embeddings for each token. The BERT Model was trained on the task of next sentence prediction task and masked language modeling. The key difference between word2vec and BERT is that, word2vec produces semantic embeddings for each word, where as BERT produces contextual word embeddings based on the relationships between surrounding words. Example - Vector Embedding of lets say word "i"See full answer

Sandeep Y. - "Functional requirement's: partial search while searching for users, products any keywords in the search. additional keywords in the filter Black listed words in the search. Non functional requirements: low latency, search through 2 Billion records recent search should be cached. Design: high reads, we should have caching enabled over the primary db storages. caching cluster can be added when the search load increases. read ahead. - check in cache (periodic cache refresh), lfu, lru "See full answer

Techzen I. - "Implemented the Java code to find the largest island. It is similar to count the island. But in this we need to keep track of max island and compute its perimeter."See full answer

Deepak K. - "FN Given text need to figure out is it following guidelines. Should notify the user in case of not following guidelines. Reason for failure should have misleading/spam/adult filters. NFN High availability High Scalability Low latency of processing Estimations 1M requests/min text - 10kb => 9.5GB/min => 14TB/day API fetchmoderationscore(text) score will be between 0 to 1 more than 0.8 => not following guidelines fetchmoderationscore(text, filter)"See full answer

Tiago R. - "class TrieNode { constructor() { this.children = {}; this.isEndOfWord = false; } } class Trie { constructor() { this.root = new TrieNode(); } insert(word) { let node = this.root; for (const char of word) { if (!node.children[char]) { node.children[char] = new TrieNode(); } node = node.children[char]; } node.isEndOfWord = true; } search(word) { l"See full answer

Ina K. - "HashMap supports insert, search, delete and retrieve in O(1). It stores data as key value pairs."See full answer

Anonymous Roadrunner - "def is_valid(s: str) -> bool: stack = [] closeToOpen = { ")" : "(", "]" : "[", "}" : "{" } for c in s: if c in closeToOpen: if stack and stack[-1] == closeToOpen[c]: stack.pop() else: return False else: stack.append(c) return True if not stack else False debug your code below print(is_valid("()[]")) `"See full answer