Data Structures questions and answers
Arrays, maps, trees, heaps and how to pick between them. Page 5 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 241-300
- Best algorithm to test if a linked list has a cycle
- Best data structure for implementing a dictionary?
- Best data structure for nearest neighbour in 1 dimension
- Best Data Structure to store marks and ranks of students
- Best dynamic data structure for 2d circle nearest neighbor
- Best hash function for mixed numeric and literal identifiers
- Best HashMap initial capacity while indexing a List
- Best implementation for hashCode method for a collection
- Best learning algorithm to make a decision tree in java?
- Best learning algorithm to make a decision tree in java?
- Best of breed indexing data structures for Extremely Large time-series
- Best practice? - Array/Dictionary as a Core Data Entity Attribute
- Best way to compare two complex objects
- Best way to concatenate List of String objects?
- Best way to convert list to comma separated string in java
- Best way to find a number in an array that's out of order?
- Best way to find first non repeating character in a string
- Best way to find if an item is in a JavaScript array?
- Best way to find the intersection of multiple sets?
- Best way to merge and remove duplicates from multiple lists in Java
- best way to query on over 15m rows?
- Best way to randomize an array with .NET
- Best way to randomize an array with .NET
- Best way to read a large file into a byte array in C?
- Best way to reduce sequences in an array of strings
- Best way to remove multiple items matching a predicate from a .NET Dictionary?
- Best way to retrieve K largest elements from large unsorted arrays?
- Best way to Update a List Concurrently
- Better results in set partition than by differencing
- Better way to check if all lists in a list are the same length?
- Better way to check if an element only exists in one array
- Better way to search for a node in binary tree
- Better way to shuffle two numpy arrays in unison
- Bidirectional 1 to 1 Dictionary in C
- Big-O summary for Java Collections Framework implementations?
- Big O of JavaScript arrays
- Binary Search in 2D Array
- Binary search to find the rotation point in a rotated sorted list
- Binary search vs binary search tree
- Binary Space Partitioning Data Structure For Donut 2D Space
- Binary tree level order traversal
- Binary Trees vs. Linked Lists vs. Hash Tables
- Binding a list in RequestParam
- Binding Combobox Using Dictionary as the Datasource
- Binning of continuous variables in sklearn ensemble and trees
- BITUsing a binary indexed tree?
- Blocking queue and multi-threaded consumer, how to know when to stop
- Bloom filter inverse? possible?
- Bloom filter or cuckoo hashing?
- Bloom filters in a distributed environment
- Boolean array reordering in O1 space and On time
- Bottom up set generation and ordering
- Breadth-first traversal
- Breadth First Search and Depth First Search
- Breadth first search branching factor
- Breadth first search the timing of checking visitation status
- Breadth First Vs Depth First
- Bridges in a connected graph
- Bron-Kerbosch algorithm for clique finding
- Bucket splitting exception in Kademlia
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