Software Engineer Interview Questions

Abdurhman M. - "Solving current problems by considering what would have happened if the past had been slightly different."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

Prakash K. - "3.3 years , java and Angular Full stack developer "See full answer

Alex M. - "A red-black tree is a self-balancing binary search tree. The motivation for this is that the benefits of O(logN) search, insertion, and deletion that a binary tree provides us will disappear if we let the tree get too "imbalanced" (e.g. there are too many nodes on one side of the tree or some branches have a depth that is way out of proportion to the average branch depth). This imbalance will occur if we don't adjust the tree after inserting or deleting nodes, hence our need for self-balancing c"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

Anonymous Wasp - "I was able to provide the optimal approach and coded it up"See full answer

Tiago R. - "function permute(nums) { if (nums.length <= 1) { return [nums]; } const prevPermutations = permute(nums.slice(0, nums.length-1)); const currentNum = nums[nums.length-1]; const permutations = new Set(); for (let prev of prevPermutations) { for (let i=0; i < prev.length; i++) { permutations.add([...prev.slice(0, i), currentNum, ...prev.slice(i)]); } permutations.add([...prev, currentNum]); } return [...permutations]"See full answer

B. T. - "You are given a string S and a number K as input, and your task is to print S to console output considering that, at most, you can print K characters per line. Example: S = "abracadabra sample" K = 11 Output: abracadabra sample Note that this problem requires the interviewee gather extra requirements from the interviewer (e.g. do we care about multiple white spaces? what if the length of a word is greater than K, ...)"See full answer

Jerry D. - "My roles included: ➢ B2B Sales of sanitary ware products to clients ➢ Sourcing of New Businesses and Managing Existing Clients ➢ Responsible for managing sales unit ➢ Developing new sales lead to meet set target. ➢ Project Management Skills: Online Sales Management · Sales Management · Customer Engagement · Sales Operations · Direct Sales · B2B Marketing"See full answer

gdecuri - "Load Balancer to multiple API Servers, pub sub system to publish user events, Game Engine Service, Write through cache and NoSQL DB. HTTP Long Polling to get user status updates"See full answer

Chung jin C. - "In my role as VP of operational model transformation was leading the definition of current and to be state of operations for a business representing >50% of the revenue & profits of the company. In a monthly feedback session, my manager shared how he noticed I had not delegated tasks and that I should work with 2 members who had been seconded to the team. We were working on a tight timeline and we wanted to get the targets completed earlier so that we can provide some buffer for further alignm"See full answer