Internship Software Engineer Interview Questions

23,655 internship software engineer interview questions shared by candidates

Instructions: You are given a k-by-k grid of letters, plus a dictionary of valid words. Your goal is to find all words you can trace out in the grid, where tracing can move up/down/left/right. For any given word, you can use each grid coordinate at most once. Example: Grid: EA BD Dictionary: {BAD, BE, BEAD, BED, DAD} Output: BE, BEAD Not in the output: BAD (diagonal move), DAD (uses bottom-right coordinate twice). Note that in a real scenario, the grid size would be ~15x15, and the dictionary size would be ~10,000.
avatar

Software Engineer(Internship)

Interviewed at Databricks

4
Dec 8, 2017

Instructions: You are given a k-by-k grid of letters, plus a dictionary of valid words. Your goal is to find all words you can trace out in the grid, where tracing can move up/down/left/right. For any given word, you can use each grid coordinate at most once. Example: Grid: EA BD Dictionary: {BAD, BE, BEAD, BED, DAD} Output: BE, BEAD Not in the output: BAD (diagonal move), DAD (uses bottom-right coordinate twice). Note that in a real scenario, the grid size would be ~15x15, and the dictionary size would be ~10,000.

There is a tree (all edged given), target nodes for a person starting from root node (list of vertices given). What is the minimum distance to visit all target nodes and return back to the root node. Follow-up: There are 2 friends with two independent target nodes. What is the minimum distance travelled by both friends ( distance of friend 1 + distance of friend 2 ) to visit their target nodes, given that at any point of time the maximum distance can be length of 1 edge ( if a person is in node x, the other person can be in the same node, its parent or in one of its child) Additional follow-up: Same as the follow-up mentioned but the distance should be at max k ( integer k given )
avatar

Software Engineer(Internship)

Interviewed at Databricks

4
Dec 17, 2024

There is a tree (all edged given), target nodes for a person starting from root node (list of vertices given). What is the minimum distance to visit all target nodes and return back to the root node. Follow-up: There are 2 friends with two independent target nodes. What is the minimum distance travelled by both friends ( distance of friend 1 + distance of friend 2 ) to visit their target nodes, given that at any point of time the maximum distance can be length of 1 edge ( if a person is in node x, the other person can be in the same node, its parent or in one of its child) Additional follow-up: Same as the follow-up mentioned but the distance should be at max k ( integer k given )

Viewing 741 - 750 interview questions

Glassdoor has 23,655 interview questions and reports from Internship software engineer interviews. Prepare for your interview. Get hired. Love your job.