tree, hash etc
Software Engineer Staff Interview Questions
2,548 software engineer staff interview questions shared by candidates
fork system call read/fread process address space race condition deadlock implement stack using linked list big endian/little endian
Questions related to Rivian's core values.
Find errors in this code snippet
technical algorithm problem, Given a list of UserLogs and another list of FunnelDefinitions, you must "merge then" by returning the users that fit with the FunneDefinition. var userLogs = [ "1,123456, click_home_page", "2,123457, click_home_page", "3,123458, click_home_page", "1,123467, add_item_to_cart", "2,123468, add_item_to_cart", "1,123478,finish_shop", "3,123479,finish_shop", ] var funnelDefinilitions = [ "Add Itens to Cart and buy it, click_home_page, add_item_to_cart,finish_shop" ] var expectedOutput = [ "Add Itens to Cart and buy it, "click_home_page (2) [1,2], add_item_to_chart ( 2)[1,2], finish_shop (1) [2]" ] So the output must have the sum by the action of the users that did that and had done the step before.
Reverse a linked list in place using only constant memory.
Basics of c , c++, Java, python, perl and svn.
What are my strengths? What is my job history?
We are working on a clone of Google Docs that allows users to collaborate on documents. Many users can work on the same document at the same time. We have 100 instances of our service running on 100 different machines. Each document needs to be managed exclusively by one instance while it is in use, but one instance can handle multiple documents at once. We have a simple load-balancing system. Because each document has a random numeric ID found in the URL, we use the value of (id % num_instances) to route traffic. For example, with 100 jobs, traffic for document #314814196 is routed to the instance with index 96. How will this system perform as the usage grows?
We are working on a clone of Facebook. We want to add a numeric count to every post showing how many friends the post" author has at the time of viewing the post, like this: Marie McWilliams (105 friends) I had a great day today, feeling good! Our database has two tables: USER 'user_id' (primary key) 'name' 'created_date' USER_RELATIONSHIP 'friendship_id' (primary key, unique to each relationship) 'user1_id' (indexed) 'user2_id' (indexed) 'start_date' Focusing on the database, how would you implement the friend-count feature? Note we will soon be more popular than Facebook, so the solution needs to scale.
Viewing 221 - 230 interview questions