Data Structures questions and answers
Arrays, maps, trees, heaps and how to pick between them. Page 17 of 20.
Data Structures & Algorithms practice on Codemia
Step through 300 algorithm problems with animated visualisers that show the data structure changing as the code runs.
Answers 961-1020
- Find an object in array?
- Find and replace string values in list
- Find array index if given value
- Find common elements from two very large Arrays
- Find common elements in N sorted arrays with no extra space
- Find connected components in a graph
- Find cycle of shortest length in a directed graph with positive weights
- Find duplicate element in array in time On
- Find duplicate entry in array of integers
- Find duplicate in array with a memory efficient approach
- Find duplicates in an array, without using any extra space
- Find duplicates in an unsorted sequence efficiently
- Find earliest time for k empty group
- Find elements in one list that are not in the other
- Find existence of number in a sorted list in constant time? Interview question
- Find first element by predicate
- find four elements in array whose sum equal to a given number X
- Find if any set is covered by member sets
- Find if there is an element repeating itself n/k times
- find if two arrays contain the same set of integers without extra space and faster than NlogN
- Find if vector contains pair with second element equal to X
- Find in python combinations of mutually exclusive sets from a list's elements
- FIND_IN_SET vs IN
- Find indices of elements equal to zero in a NumPy array
- Find intersection of two nested lists?
- Find kth smallest element in a binary search tree in Optimum way
- find kth smallest number in Ologn time
- Find local minima in an array
- find lowest index of a given value in a presorted array
- Find maximum value in an array by recursion
- Find median in binary search tree
- Find median value from a growing set
- find median with minimum time in an array
- Find min / max value in Swift Array
- Find minimal Ai2 Bi2 when A and B are sorted
- Find minimum cost to convert array to arithmetic progression
- Find nearest value in numpy array
- Find next higher element in an array for each element
- Find non-common elements in lists
- Find number of bits to be flipped to get maximum 1's in array
- Find number of permutations of a given sequence of integers which yield the same binary search tree
- Find object in list that has attribute equal to some value that meets any condition
- Find only two numbers in array that evenly divide each other
- Find out which combinations of numbers in a set add up to a given total
- find pair of numbers in array that add to given sum
- Find pairs in an array such that ab k , where k is a given integer
- Find rectangles that contain point – Efficient Algorithm
- Find running median from a stream of integers
- Find Second largest number in array at most nlog₂n−2 comparisons
- Find set of numbers in one collection that adds up to a number in another
- Find shortest subarray containing all elements
- Find the 2nd largest element in an array with minimum number of comparisons
- Find the best combination from a given set of multiple sets
- Find the biggest interval that has all its members in list in On
- Find the Element Occurring b times in an an array of size nkb
- Find the element repeated more than n / 2 times
- Find the first element in a sorted array that is greater than the target
- Find the first element strictly less than a key in a vector sorted in descending order
- Find the first un-repeated character in a string
- Find the k non-repeating elements in a list with little additional space
Course
Intermediate
27 lessons
15 hours
DSA Fundamentals
Master algorithmic patterns and data structures through hands-on LeetCode-style problems - from arrays and hashing to dynamic programming and advanced graphs.
View the course