Data Structures questions and answers
Arrays, maps, trees, heaps and how to pick between them. Page 15 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 841-900
- Efficient data structure/algorithm for transliteration based word lookup
- Efficient list intersection algorithm
- Efficient manipulation of a list of cartesian coordinates in Python
- Efficient method for finding KNN of all nodes in a KD-Tree
- Efficient minimal spanning tree in metric space
- Efficient queue in Haskell
- Efficient set intersection of a collection of sets in C
- Efficient swapping of elements of an array in Java
- Efficient time and space complexity data structure for dense and sparse matrix
- Efficient way to compare two arrays
- Efficient way to find degrees of separation between two nodes in a graph
- Efficient way to insert a number into a sorted array of numbers?
- Efficient way to remove half of the duplicate items in a list
- Efficient way to rotate a list in python
- Efficient way to search an element
- Efficient way to store millions of arrays, and perform IN check
- Efficient way to union two list with list or None value
- Efficiently convert edge list to adjacency list using MapReduce
- Efficiently find all connected induced subgraphs
- efficiently find amount of integers in a sorted array
- Efficiently find an integer not in a set of size 40, 400, or 4000
- Efficiently find binary strings with low Hamming distance in large set
- Efficiently finding duplicates in a list
- Efficiently finding the largest surrounding square in 2D grid
- Efficiently randomly shuffling the bits of a sequence of words
- Efficiently selecting a set of random elements from a linked list
- Ehcache - using a ListInteger as the cache value
- Election Algorithms - A ring algorithm
- Element-wise addition of 2 lists?
- elif in list comprehension conditionals
- Eliminating cyclic flows from a graph
- Empty set literal?
- Emulating Amazon SQS during development
- Ensuring a partially connected digraph is strongly connected
- Enumerating all paths in a directed acyclic graph
- Enumerating all paths in a tree
- Environment variables for list in spring boot configuration
- Eppstein's algorithm and Yen's algorithm for k shortest paths
- equals vs Arrays.equals in Java
- Equivalence classes and union/find in a functional language
- Errata in the original paper on suffix arrays?
- Error AccessControlListNotSupported when trying to create a bucket ACL in AWS
- Error dictionary update sequence element 0 has length 1; 2 is required on Django 1.4
- Error Expected 2D array, got 1D array instead Using OneHotEncoder
- Error in Python script Expected 2D array, got 1D array instead?
- ErrorCannot fit requested classes in a single dex file.Try supplying a main-dex list. methods 72477 65536
- Examples/Illustration of Wait-free And Lock-free Algorithms
- Exception CallbackOnCollectedDelegate when creating tensorflow graph
- execute a function against array items in sequence
- Executing frozen tensorflow graph that uses tensorflow.contrib.resampler using c_api.h
- Expanding tuples into arguments
- Expiry Policy on Off Heap entries not working as expected in Ignite
- Explain how recursion works in an algorithm to determine depth of binary tree?
- Explain Merkle Trees for use in Eventual Consistency
- Explain the use of a bit vector for determining if all characters are unique
- Explain using xor to find two non-duplicate integers in an array
- Explanation of Algorithm for finding articulation points or cut vertices of a graph
- Explanation of Merge Sort for Dummies
- Explicitly select items from a list or tuple
- Export Tensorflow graphs from Python for use in C
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