Visa | Sr. Software Engineer | Singapore | Aug [Offer]
[ OK ]ThM9OT3UbZ — full writeup
[ INFO ]category: Behavioral · Onsite difficulty: difficult freq: first seen: 2019-11-16
[DIFFICULT][ONSITE]OnsiteSWE III (Senior)Accepted
$catproblem.md
Status: Software Engineer with 2.5 years of professional experience
Position: Sr. Software Engineer
Location: Singapore
Date: August
Online Assessment: 2 hours
String Similarity: For 2 strings A and B, find the length of the longest prefix common to both. [Similar problem: Longest Common Prefix from Leetcode]
K-subsequences: Subsequence of consecutive elements (n elements), sum of subsequence element is divisible by k. [Similar problem: Subarray Sums Divisible by K from Leetcode]
Most Frequent Substring: Given a string s, want to know the maximum no of occurrences of any substring that satisfies: substring's length within inclusive range minL to maxL, total no of unique char in substring does not exceed maxUnq. maxL
IP Address validation: given n strings we have to determine if it is a valid Internet Protocol addresses Protocol. [Similar Problem: Validate IP address from Leetcode]
Round 1: 1 hour
In a stream of numbers, find the min, max, mean, median and mode of all the numbers encountered so far. [Similar problem: Median from data stream from Leetcode]
Round 2: 1 hour
Given an array, find the K most frequent elements in the array. [Similar problem: Top K Frequent words from Leetcode]
Round 3: 1 hour
What are virtual functions?
What is runtime and compile time polymorphism?
How are virtual functions implemented?
How do they work in the compile phase?
What does it mean to have a log n complexity of an algorithm?
What constraints are needed for binary search to work?