Data Structures questions and answers
Arrays, maps, trees, heaps and how to pick between them. Page 12 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 661-720
- Dead letter queue (DLQ) for Kafka with spring-kafka
- deceptively simple implementation of topological sorting in python
- Decision tree implementation for returning the next feature to split the tree
- Decision tree implementation issue in apache spark with java
- Decision Tree in Matlab
- Decision Tree Learning and Impurity
- Decision tree using continuous variable
- Decision trees. Choosing thresholds to split objects
- Declare a const array
- Declare a dictionary inside a static class
- Deep copy of a dict in python
- Deep merge dictionaries of dictionaries in Python
- Default Capacity of List
- defaultdict of defaultdict?
- Delayed message consumption in Kafka
- Delete a dictionary item if the key exists
- Delete all keys from a NSUserDefaults dictionary iOS
- Delete all the queues from RabbitMQ?
- Delete an element from a dictionary
- Deleting all but a few nodes in TensorFlow graph
- Deleting array elements in JavaScript - delete vs splice
- Deleting message from SQS FIFO queue The receipt handle has expired
- Deleting multiple elements from a list
- Deleting queues in RabbitMQ
- deletion in a binary search tree
- Deletion procedure for a Binary Search Tree
- Demultiplexing messages from a queue to process in parallel streams using amqp?
- Dependency graph of Visual Studio projects
- Depth First Search and Breadth First Search Understanding
- Design a Data Structure for web server to store history of visited pages
- Design a Hashtable
- design a stack such that getMinimum should be O1
- Detect application heap size in Android
- Detect when a graph has been broken into two or more connected components
- Detect when RecyclerView reaches the bottom most position while scrolling
- Detecting consecutive integers in a list
- Detecting duplicates in an array using divide and conquer
- Detecting HTML table orientation based only on table data
- Detecting Singularities in a Graph
- Determine if 2 lists have the same elements, regardless of order?
- Determine if a binary tree is subtree of another binary tree using pre-order and in-order strings
- Determine if Json results is object or array
- Determine if more than half of the array repeats in a distinct array
- Determine the most common occurrence in an array
- Determine whether an array contains a value
- Determine whether or not there exist two elements in Set S whose sum is exactly x - correct solution?
- Determining if an unordered vectorT has all unique elements
- Determining if Swift dictionary contains key and obtaining any of its values
- Determining whether or not a directed or undirected graph is a tree
- DFS Algorithm Traversal
- Diagram connector algorithm
- Dictionaries and default values
- Dictionary - one key, many values
- Dictionary using Red-Black tree - deletion error
- Dictionary.FirstOrDefault how to determine if a result was found
- Diff for Directed Acyclic Graphs
- Difference and advantages between dijkstra A star
- Difference between AVL trees and splay trees
- Difference between bidirectional_dynamic_rnn and stack_bidirectional_dynamic_rnn in Tensorflow
- Difference between binary search and 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