Data Structures questions and answers
Arrays, maps, trees, heaps and how to pick between them. Page 6 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 301-360
- BufferError Local Queue full in Python
- Build a binary tree from an infix expression without using a stack
- Build a graph that works with variable batch size using Tensorflow
- Build graph of organizational structure
- Build trie faster
- Building asynchronous future callback chain from compile-time dependency graph DAG
- Building Tensorflow Graphs Inside of Functions
- built-in max heap API in Python
- Byte to ASCII
- byte[] to file in Java
- C-like structures in Python
- C11 Async operation on a tree
- C11 thread-safe queue
- C5.0 decision tree - c50 code called exit with value 1
- C - How to implement Set data structure?
- C and arrays of anonymous objects
- C# Convert ReadOnlyMemory<byte> to byte[]
- C Decision Tree Implementation Question Think In Code
- C Determine if List Has
- C Efficiently Calculating a Running Median
- C equivalent of rotating a list using python slice operation
- C equivalent to Java's Exception.printStackTrace?
- C hashcode for array of ints
- C How to draw a Binary Tree to the console
- C int to byte
- C# Java HashMap equivalent
- C List - Removing items while looping / iterating
- C List Sort by x then y
- C# List<string> to string with delimiter
- c MemoryStream vs Byte Array
- C select algorithm
- C Set collection?
- C set counting elements less than a value
- C Sortable collection which allows duplicate keys
- Cache oblivious lookahead array
- Calculate if two infinite regex solution sets don't intersect
- Calculate minimal operations to make two tree structures identical
- Calculating a cutting list with the least amount of off cut waste
- Calculating all of the subsets of a set of numbers
- Calculating the shortest route between two points
- Calculating the similarity of two lists
- Call int function on every list element?
- Can a Byte Array be written to a file in C?
- Can an array be grouped more efficiently than sorted?
- Can anyone explain the deletion of Left-Lean-Red-Black tree clearly?
- Can Dijkstra's Algorithm work on a graph with weights of 0?
- Can Dijkstra's Single Source Shortest Path Algorithm detect an infinite cycle in a graph?
- Can hash tables really be O1?
- Can I do this with Boost interval_map?
- Can I encode a string to an integer in a way that preserves lexicographic string closeness?
- Can I extract fp-tree (any format) in spark?
- Can I get JSON to load into an OrderedDict?
- Can I iterate through queues using the RabbitMQ .NET Client?
- Can I make http requests directly to the janusGraph server?
- Can I pass an array as arguments to a method with variable arguments in Java?
- Can I Set androidlayout_below at Runtime Programmatically?
- Can I specify RabbitMQ credentials in node.js?
- Can I use a collection initializer for DictionaryTKey, TValue entries?
- Can I use arbitrary metrics to search KD-Trees?
- Can I use arbitrary metrics to search KD-Trees?
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