Data Structures questions and answers
Arrays, maps, trees, heaps and how to pick between them. Page 14 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 781-840
- Does a HashMap with string keys really have a lower time complexity than a Trie?
- Does a lambda expression create an object on the heap every time it's executed?
- Does a ListT guarantee that items will be returned in the order they were added?
- Does A work with negative weights as long that the heuristic is admissible?
- Does anybody know how B-Tree got its name?
- Does C have a way of giving me an immutable Dictionary?
- Does Dijkstra's algorithm apply even if there is only one negative weight edge?
- Does errors.deadletterqueue.topic.name work for source connector
- Does HashSet preserve insertion order?
- Does Java SE 8 have Pairs or Tuples?
- Does Kafka have a batch consumer?
- Does ListT guarantee insertion order?
- Does .NET have a way to check if List a contains all items in List b?
- Does Python have an ordered set?
- Does RabbitMQ call the callback function for a consumer when it has some message for it?
- Does rabbitmq support binding a single queue to multi exchanges?
- Does Tensorflow simplify a computational graph?
- Does using new on a struct allocate it on the heap or stack?
- Does YugaByte DB’s YSQL API support array types
- Double Iteration in List Comprehension
- Dremel - repetition and definition level
- Duplicate a LinkedList with a pointer to a random node apart from the next node
- duplicate a tensorflow graph
- Duplicate keys in .NET dictionaries?
- Dynamic Array with O1 removal of any element
- Dynamic queue creation with RabbitMQ
- Dynamically creating asynchronous message queues in Java
- Dynamically updating shortest paths
- DynamoDB adjacency list primary key
- DynamoDB Is adding an item using list_append atomic?
- DynamoDB M-M Adjacency List Design Pattern
- DynamoDB ordered list
- DynamoDB Scan with filter, matching ''is-in-set'' conditions
- DynamoDB SET list_append not working using aws sdk
- DynamoDB SET list_append not working using aws sdk
- Easier way to populate a list with integers in .NET
- Easiest way of using min priority queue with key update in C
- Easiest way to compare arrays in C
- Easy way to convert Iterable to Collection
- Edit distance between two graphs
- Editing dictionary values in a foreach loop
- Edmonds-Karp Algorithm for a graph which has nodes with flow capacities
- Effective unique on unordered elements
- Efficient Algorithm for Bit Reversal from MSB-LSB to LSB-MSB in C
- Efficient algorithm for converting a character set into a nfa/dfa
- Efficient algorithm for detecting cycles in a directed graph
- Efficient algorithm for finding all maximal subsets
- Efficient algorithm for finding the largest overlapping range given a list of ranges
- Efficient algorithm for Given an unsorted array of positive integers and an integer N, return N if N existed in array or the first number N
- Efficient algorithm to determine if an alleged binary tree contains a cycle?
- Efficient algorithm to find all the paths from A to Z?
- efficient algorithm to find nearest point in a graph that does not have a known equation
- Efficient algorithm to find the largest rectangle from a set of points
- Efficient algorithm to get the combinations of all items in object
- Efficient Array Storage for Binary Tree
- Efficient Cartesian Product algorithm
- Efficient data structure for sparse data lookup
- Efficient Data Structure For Substring Search?
- Efficient data structure for word lookup with wildcards
- Efficient data structure that checks for existence of String
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