The majority of the phone screen was rapid-fire technical questions; general cs knowledge questions that had straightforward answers. The first several were about data structures--properties of arrays, linked lists, hash tables, and what scenarios each are useful for. Then a few object oriented design questions (touched on the major concepts--polymorphism, inheritance/abstraction, data encapsulation, overriding/overloading). Asked about difference between process and thread.
It was related to linux directory path parsing.
Tell me about yourself Basis DSA questions
What’s the difference between stored and computed properties?
One of the leetcode problems if you filter by company.
How you optimize {project function} to handle large amount of requests at same time, give me a optimized solution
2 leetcode medium problems and come up with their analyses.
Try to reverse a linked list
Flatten a multilevel linked list (not a doubly linked list)
Round1: Given a matrix filled with different integers and an entry point, count the number of connected points(adjacent up, down, left, right) with the same value as the entry point. Round 2: Box stacking problem without rotating sides. Do it using DP. Find all paths from a source to destination in a graph.
Viewing 2121 - 2130 interview questions