Data Structures questions and answers
Arrays, maps, trees, heaps and how to pick between them. Page 18 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 1021-1080
- Find the largest possible difference in an array with the smaller integer occurring earlier
- Find the majority element in array
- find the max difference between j and i indices such that j i and aj ai in On
- Find the maximum number of edges in the graph
- Find the median of the sum of the arrays
- Find the middle of unknown size list
- Find the min/max element of an array in JavaScript
- Find the missing and duplicate elements in an array in linear time and constant space
- Find the most common element in a list
- Find the most common entry in an array
- Find the next greater element in an array
- Find the number of elements greater than x in a given range
- Find the number of nodes of n-element heap of given height
- Find the number of remove-then-append operations needed to sort a given array
- Find the number of repeated subarray in an array
- Find the one non-repeating element in array?
- find the only unpaired element in the array
- Find the paths between two given nodes?
- Find the row representing the smallest integer in row wise sorted matrix
- Find the second smallest number in a list using recursion
- Find the shortest path in a graph which visits certain nodes
- Find the Smallest Integer Not in a List
- Find the smallest number that is greater than a given number in a sorted list
- Find the subarray with the max XOR from an array using a trie
- Find the top k sums of two sorted arrays
- Find the two repeating elements in a given array
- Find the x smallest integers in a list of length n
- Find top N elements in an Array
- Find triplets in better than linear time such that An-1 An An1
- Find two elements in an array that sum to k
- Find unique rows in numpy.array
- Find whether a minimum spanning tree contains an edge in linear time?
- Finding a corresponding leaf node for each data point in a decision tree scikit-learn
- Finding a minimal subarray of n integers of sum k in linear time
- Finding a minimum spanning tree on a directed graph
- Finding a New Minimum Spanning Tree After a New Edge Was Added to The Graph
- Finding a number that repeats even no of times where all the other numbers repeat odd no of times
- Finding a single number in a list
- Finding Aii in a sorted array with duplicates
- Finding All Combinations Cartesian product of JavaScript array values
- Finding all cycles in a directed graph
- Finding all cycles in an undirected graph
- Finding all disconnected subgraphs in a graph
- Finding all the shortest paths between two nodes in unweighted undirected graph
- Finding all the subsets of a set
- Finding an element in an array where every element is repeated odd number of times but more than single occurrence and only one appears once
- Finding an number in montonically increasing and then decreasing sequencecera
- Finding and replacing elements in a list
- Finding blocks in arrays
- Finding bridges in graph without recursion
- Finding cartesian product with PHP associative arrays
- Finding centre of rotation for a set of points
- Finding common elements in two arrays of different size
- finding common prefix of array of strings
- Finding Contiguous Areas of Bits in 2D Bit Array
- Finding dictionary words
- Finding duplicates in On time and O1 space
- Finding first non-repeating number in integer array
- Finding height in Binary Search Tree
- Finding if a Binary Tree is a Binary Search Tree
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