Hi All,\n**Status:** 8 years of experience\n**Position:** Senior SDE at Non FANG\n**Location:** Seattle, WA\n \n**Phone Interview:**\n Question 1: [K Closest Points](https://leetcode.com/problems/k-closest-points-to-origin/)\n Question 2: [Number of Island](https://leetcode.com/problems/number-of-islands/)\n \n ***Weird Onsite Interview (No System Design and No OOP Design):***\n\nQuestion 1: \n 2 behavior question\n Coding question: Implement a function to handle Traffic Light\n \n**Question 2:**\n Given an Ad traffic Log. Your goal is to figure out how many total impressions each Ad served, \n and how many purchases can can be attributed (mapped) to each ad\n \n Ad traffic Log\n timestamp     ad-id    customer-id  prod-id\n 00:00:01      123  12334             34556   \n00:00:02      567  12334             34556 \n00:00:03      876  56438             34860 \n\t \nPurchase Log:\n timestamp customer-id  prod-id\n00:00:01     12334             34556   \n\nOutput: \nAd-id total impressions  total purchase\n123            2                    1\n\n**Question 3:**\nGiven a root node of a tree, transform the nodes into a singly linked list, \nwhich is ordered from top to bottom and left to right\ninput:\n\t    a\n     /  |  \\\n  b   c   d\n /         /  \\ \nf          g  h\nOutput:\na->b->c->d->f->g->h\n\n**Question 4: Leetcode 692**\n[Top K frequent words in text](https://leetcode.com/problems/top-k-frequent-words/)

Hi All,\nStatus: 8 years of experience\nPosition: Senior SDE at Non FANG\nLocation: Seattle, WA\n \nPhone Interview:\n Question 1: K Closest Points\n Question 2