Skip to contentSkip to footer

Software Engineer Data Interview Questions

Salaries
Interviews

456 software engineer data interview questions shared by candidates

// Given a singly linked list without values defined by: class Node { Node next } // Write a function that removes all elements from the list whose _index_ is a fibonacci number // o -> o -> o -> o -> o -> o -> o -> o -> o -> o -> o -> o // 0 1 2 3 4 5 6 7 8 9 10 11 // x x x x x // becomes // o ----------------> o ------> o -> o ------> o -> o -> o // 0 4 6 7 9 10 11
avatar

Software Engineer/Data Scientist

Interviewed at Tripadvisor

3.5★
Oct 29, 2014

// Given a singly linked list without values defined by: class Node { Node next } // Write a function that removes all elements from the list whose _index_ is a fibonacci number // o -> o -> o -> o -> o -> o -> o -> o -> o -> o -> o -> o // 0 1 2 3 4 5 6 7 8 9 10 11 // x x x x x // becomes // o ----------------> o ------> o -> o ------> o -> o -> o // 0 4 6 7 9 10 11

1. Given a graph and a node in the graph, return a deep copy of the node. 2. Given a frequency distribution of objects, write a random object generator which produces objects based on their probability distribution.
avatar

Software Engineer - Data Science Intern

Interviewed at Sift

3.4★
Feb 5, 2016

1. Given a graph and a node in the graph, return a deep copy of the node. 2. Given a frequency distribution of objects, write a random object generator which produces objects based on their probability distribution.

Problem: o A traveler flies to many cities (airports) in an unbroken chain of flights with no loops i.e never revisiting an airport. o For every flight, she has a boarding pass with only a From (City) and To (City) printed on it but no date/time. o At the end of her journey, she hands you all her boarding passes but they’re shuffled, so you don’t know the starting or the ending city. Can you: o Write logic or pseudocode to print her whole journey in sequence. It should print e.g. (Starting) City1 -> City2 ->….-> (Ending) CityX o State the time complexity of your solution. o you’re given a Set of BoardingPass objects as input. o there could be as many as hundreds of thousands of unique cities/airports. o memory is no concern (i.e. you have infinite memory!). Optimize for execution time (time complexity).
avatar

Senior Software Engineer - Data Persistence & Messaging

Interviewed at Workday

3.5★
May 19, 2016

Problem: o A traveler flies to many cities (airports) in an unbroken chain of flights with no loops i.e never revisiting an airport. o For every flight, she has a boarding pass with only a From (City) and To (City) printed on it but no date/time. o At the end of her journey, she hands you all her boarding passes but they’re shuffled, so you don’t know the starting or the ending city. Can you: o Write logic or pseudocode to print her whole journey in sequence. It should print e.g. (Starting) City1 -> City2 ->….-> (Ending) CityX o State the time complexity of your solution. o you’re given a Set of BoardingPass objects as input. o there could be as many as hundreds of thousands of unique cities/airports. o memory is no concern (i.e. you have infinite memory!). Optimize for execution time (time complexity).

Viewing 41 - 50 interview questions

Glassdoor has 456 interview questions and reports from Software engineer data interviews. Prepare for your interview. Get hired. Love your job.