Meta Data Structures & Algorithms Interview Questions

Review this list of 90 Meta Data Structures & Algorithms interview questions and answers verified by hiring managers and candidates.

+ Share interview

Given a collection of rooms where Alibada is in one and moves one room a day to an adjacent room, write a program to determine if you can find Alibada with the given list of rooms.
4 years ago2 answers
Determine a ship's capacity to ship packages in D days.
3 years ago
Given a Directed Acyclic Graph (DAG), write a function to return the length of the longest path.
2 months ago
Determine the minimum number of parentheses needed to balance a given string.
3 years ago
Find the smallest missing element from a sorted array.
5 years ago1 answer
Get your questions answered
Our question database is made possible by user contributions. What were you asked in your most recent interview?
Share
Find the length of the shortest word ladder.
2 years ago
Design a data structure that supports insert, delete, search, and retrieve in constant time.
3 years ago1 answer
Calculate the result of a mathematical expression written as a string.
3 years ago
Implement a doubly linked list.
6 months ago1 answer
Explain the solution for Leetcode problem 1010: Pairs of Songs With Total Durations Divisible by 60.
21 days ago
Traverse a matrix or grid to find the shortest path between point A and point B.
9 months ago
Design the ad management logic for surfacing ads based on user preferences or profiles.
9 months ago
Basic Calculator II
+19 months ago
Efficiently find the next greatest element in an array.
3 years ago
Given an array representing the height of buildings from a sea beach, return an array of heights of the buildings that have a sea view.
5 years ago1 answer
Implement serialize(root) + deserialize(data) so the same tree comes back
4 months ago
Find the dot product of two sparse vectors.
3 years ago
Determine if two words are sorted in lexicographic order.
3 years ago
Given nums + window size k, return the max for each sliding window in O(n) time complexity.
4 months ago
Merge two lists where one has empty spaces at the end.
9 months ago

Showing 61-80 of 90

Popular roles

Product Manager Software Engineer Data Scientist Engineering Manager Technical Program Manager

Interviewed recently?

Help improve our question database (and earn karma) by telling us about your experience

+ Share interview experience

Trending companies

Meta Data Structures & Algorithms Interview Questions

Given a collection of rooms where Alibada is in one and moves one room a day to an adjacent room, write a program to determine if you can find Alibada with the given list of rooms.

Determine a ship's capacity to ship packages in D days.

Given a Directed Acyclic Graph (DAG), write a function to return the length of the longest path.

Determine the minimum number of parentheses needed to balance a given string.

Find the smallest missing element from a sorted array.

Find the length of the shortest word ladder.

Design a data structure that supports insert, delete, search, and retrieve in constant time.

Calculate the result of a mathematical expression written as a string.

Implement a doubly linked list.

Explain the solution for Leetcode problem 1010: Pairs of Songs With Total Durations Divisible by 60.

Traverse a matrix or grid to find the shortest path between point A and point B.

Design the ad management logic for surfacing ads based on user preferences or profiles.

Basic Calculator II

Efficiently find the next greatest element in an array.

Given an array representing the height of buildings from a sea beach, return an array of heights of the buildings that have a sea view.

Implement serialize(root) + deserialize(data) so the same tree comes back

Find the dot product of two sparse vectors.

Determine if two words are sorted in lexicographic order.

Given nums + window size k, return the max for each sliding window in O(n) time complexity.

Merge two lists where one has empty spaces at the end.

Explore questions by company

Explore questions by role

Follow Us