Data Structures questions and answers
Arrays, maps, trees, heaps and how to pick between them. Page 4 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 181-240
- Are there any distributed cache solution that is similar to a skip list?
- Are There Any Good C Suffix Trie Libraries?
- Are there any interesting algorithms using both a stack and queue deque ADT?
- Are there any online algorithms for planarity testing?
- Are there O1 random access data structures that don't rely on contiguous storage?
- Are tuples more efficient than lists in Python?
- Argument for O1 average-case complexity of heap insertion
- Arrange array so adjacent has less space that gives minimum sum
- Array extension to remove object by value
- Array extension to remove object by value
- Array from dictionary keys in swift
- Array from dictionary keys in swift
- Array maximum difference algorithm that runs in On?
- Array must contain 1 element
- Array of 10000 having 16bit elements, find bits set unlimited RAM - Google interview
- Array of random numbers with sum in given range?
- Array of size n, with one element n / 2 times
- Array or List in Java. Which is faster?
- Array remove duplicate elements
- Array to Binary Search Trees Quick
- Array versus ListT When to use which?
- Array.Copy vs Buffer.BlockCopy
- ArrayList initialization equivalent to array initialization
- ArrayList vs List in C
- ArrayList.sort vs PriorityQueue
- Arrays Find minimum number of swaps to make bitonicity of array minimum?
- Arrays of Int arrays. Storing duplicates in order only
- Arrays.asList vs Collections.singletonList
- Assert equals between 2 Lists in Junit
- Async Concurrent Queue with max concurrency
- Async method calling from c get set property
- Async update of array in Angular
- Asynchronous Bounded Queue in JS/TS using async/await
- At what stage is a tensorflow graph set up?
- Attempt to insert non-property list object when trying to save a custom object in Swift 3
- Attempt to set a non-property-list object as an NSUserDefaults
- AttributeError list object has no attribute add
- Auto-initializing C lists
- Autocomplete using a trie
- Average values of dictionaries
- awaitable Task based queue
- AWS Athena Querying by an attributes of a struct with an array
- AWS CLI ECR list-images, get newest
- AWS cloud formation Template- providing Tags for the stack in the template
- AWS CloudFormation create-stack vs deploy
- AWS CloudFormation Stack update error Requires capabilities CAPABILITY_IAM
- AxisError axis 1 is out of bounds for array of dimension 1 when calculating accuracy of classes
- B-Tree - Why can't there be a node with an even number of keys?
- B-tree faster than AVL or RedBlack-Tree?
- B-Tree vs \`Hash\` Table
- Back pressure in Kafka
- Balanced spanning tree T from undirected graph
- Balancing a binary search tree
- Balancing a ternary search tree
- balancing an AVL tree C
- Bellman-Ford vs Dijkstra Under what circumstances is Bellman-Ford better?
- Belman-Ford algorithm in 2d Array
- Best algorithm for delete duplicates in array of strings
- Best algorithm for determining the high and low in an array of numbers?
- Best Algorithm to Invite People to Party
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