Data Structures questions and answers
Arrays, maps, trees, heaps and how to pick between them. Page 13 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 721-780
- Difference between del, remove, and pop on lists in Python
- Difference between del, remove, and pop on lists in Python
- Difference between dispatch_async and dispatch_sync on serial queue?
- Difference between dispatch_async and dispatch_sync on serial queue?
- Difference between DTO, VO, POJO, JavaBeans?
- Difference between event queue and message queue
- Difference between hamiltonian path and euler path
- Difference between HashMap, LinkedHashMap and TreeMap
- Difference between HashSet and HashMap?
- Difference between int[] array and int array[]
- Difference between List, List?, ListT, ListE, and ListObject
- Difference between Lookup and DictionaryOf list
- Difference between numpy.array shape R, 1 and R,
- Difference between on-heap and off-heap
- Difference between ordered and unordered rooted trees
- Difference between Prim's and Dijkstra's algorithms?
- Difference between priority queue and a heap
- Difference between stdset and stdpriority_queue
- difference between Tensorflow's Graph and GraphDef
- Difference between the System.Array.CopyTo and System.Array.Clone
- Difference of Dictionary.Add vs Dictionarykeyvalue
- Difference of HashMap in alt-rt.jar and rt.jar?
- difference of two sets of intervals
- Differences between GSI and table
- Different decision tree algorithms with comparison of complexity or performance
- Different ways of clearing lists
- Dijkstra algorithm for 2D array in Java
- Dijkstra vs. Floyd-Warshall Finding optimal route on all node pairs
- Dijkstra with Parallel edges and self-loop
- Dijkstra's algorithm a greedy or dynamic programming algorithm?
- Dijkstra's Algorithm and Cycles
- Dijkstra's algorithm in python
- Dijkstra's Algorithm modification
- Dimension-independent loop over boostmulti_array?
- Directed graph node neighbors
- Directed Graph Processing in Java
- Directed maximum weighted bipartite matching allowing sharing of start/end vertices
- Directory-tree listing in Python
- Discover periodic patterns in a large data-set
- Disperse Duplicates in an Array
- Display image of graph in TensorFlow?
- Display lines number in Stack Trace for .NET assembly in Release mode
- Distinction between iterator and enumerator
- Distinguishing extra element from two arrays?
- distributed algorithm in C
- Distributed Graph Search
- Distributed locks with queue
- Distributed tensorflow the difference between In-graph replication and Between-graph replication
- Distributed Transaction vs Message Queue
- divide list in two parts that their sum closest to each other
- Divide the list into three lists such that their sum are close to each other
- Dividing a plane of points into two equal halves
- Dividing an array into K subsets such that sum of all subsets is same using bitmasksDP
- Django template how to look up a dictionary value with a variable
- Django values_list vs values
- Do I give cross_val_score the entire dataset or just the training-set?
- Do Java arrays have a maximum size?
- Do minimum depth, spanning trees algorithms exist?
- Do not use tf.reset_default_graph to clear nested graphs
- Do threads have a distinct heap?
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