Data Structures & Algorithms Interview Questions

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

+ Share interview

Calculate the result of a mathematical expression written as a string.
3 years ago
Given a list of integers, return 1 if the integer is a power of 2 and 0 if it is not.
5 years ago3 answers
Find the shortest distance between two points.
2 months ago
Implement serialize(root) + deserialize(data) so the same tree comes back
3 months ago
Explain the time complexity differences between ArrayList and LinkedList.
2 years ago2 answers
Get your questions answered
Our question database is made possible by user contributions. What were you asked in your most recent interview?
Share
Implement wildcard pattern matching for a string (s) and a pattern (p) with '?' and '*' in a way that covers the entire input string.
4 years ago3 answers
Implement a doubly linked list.
5 months ago1 answer
Implement merge-sort
2 years ago1 answer
Given a fully or partially attempted 9x9 Sudoku board, determine if it is a valid solution.
5 months ago
Implement a function to find the minimum number of dice rolls needed to reach the end in a Snakes and Ladders game.
a year ago
Explain the solution for Leetcode problem 1010: Pairs of Songs With Total Durations Divisible by 60.
10 days ago
Find the k-th smallest and k-th largest element in a binary search tree (BST).
2 years ago1 answer
Explain how hash maps work.
2 years ago1 answer
Print all combinations of numbers from 1 to n that sum to n.
+22 years ago2 answers
Implement Pascal's Triangle.
3 years ago
Can Jump - Given an array of non-negative integers, you're initially at the first index. Each element represents your maximum jump length at that position. Determine if you can reach the last index.
2 years ago
What do you know about algorithms?
5 months ago
Given an array, print the Next Greater Element (NGE) for each element. The NGE for an element x is the first greater element on the right side of x in the array, or -1 if none exists.
4 years ago3 answers
Explain the map function.
3 years ago2 answers
Efficiently find the next greatest element in an array.
3 years ago

Showing 261-280 of 336

Popular roles

Software Engineer Machine Learning Engineer Data Engineer Data Scientist Engineering Manager

Interviewed recently?

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

+ Share interview experience

Trending companies

Data Structures & Algorithms Interview Questions

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

Given a list of integers, return 1 if the integer is a power of 2 and 0 if it is not.

Find the shortest distance between two points.

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

Explain the time complexity differences between ArrayList and LinkedList.

Implement wildcard pattern matching for a string (s) and a pattern (p) with '?' and '*' in a way that covers the entire input string.

Implement a doubly linked list.

Implement merge-sort

Given a fully or partially attempted 9x9 Sudoku board, determine if it is a valid solution.

Implement a function to find the minimum number of dice rolls needed to reach the end in a Snakes and Ladders game.

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

Find the k-th smallest and k-th largest element in a binary search tree (BST).

Explain how hash maps work.

Print all combinations of numbers from 1 to n that sum to n.

Implement Pascal's Triangle.

Can Jump - Given an array of non-negative integers, you're initially at the first index. Each element represents your maximum jump length at that position. Determine if you can reach the last index.

What do you know about algorithms?

Given an array, print the Next Greater Element (NGE) for each element. The NGE for an element x is the first greater element on the right side of x in the array, or -1 if none exists.

Explain the map function.

Efficiently find the next greatest element in an array.

Explore questions by company

Explore questions by role

Follow Us