Data Structures questions and answers
Arrays, maps, trees, heaps and how to pick between them. Page 7 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 361-420
- Can I use Kafka queue in my Rest WEBSERVICE
- Can list_display in a Django ModelAdmin display attributes of ForeignKey fields?
- Can rollback still occur on a MongoDB replica set with J1 and WMajority?
- Can we apply the Bellman-Ford algorithm to an Undirected Graph?
- Can we set in-memory Mongodb set as primary and WiredTiger as a non-voting replica?
- Can we use binary search tree to simulate heap operation?
- Can we use Morris Traversal for postorder?
- Can XOR metric be used to implement DHT without Kademlia?
- Cannot deploy MongoDB replica set on windows?
- Cannot use the given session to evaluate tensor the tensor's graph is different from the session's graph
- Cannot use the given session to evaluate tensor the tensor's graph is different from the session's graph
- Can't import frozen graph with BatchNorm layer
- Cartesian product of multiple arrays in JavaScript
- Cartesian product of x and y array points into single array of 2D points
- case-insensitive list sorting, without lowercasing the result?
- Case insensitive string as HashMap key
- CassandraThe stack size specified is too small, Specify at least 228k
- Casting AnyObject to Dictionary in swift
- Caterpillars and Leaves. Can we do better than Onc?
- celery - call function on task done
- Celery and RabbitMQ - queue priority vs. consumer priority vs. task priority
- Celery chain not working with batches
- Celery dynamic queue creation and routing
- Celery how can I route a failed task to a dead-letter queue
- Celery how to limit number of tasks in queue and stop feeding when full?
- Celery rpc vs amqp result backend
- Celery with Amazon SQS
- Celery with rabbitmq creates results multiple queues
- celeryev Queue in RabbitMQ Becomes Very Large
- Challenge,how to implement an algorithm for six degree of separation?
- Change MySQL default character set to UTF-8 in my.cnf?
- Change priorityQueue to max priorityqueue
- Change the name of a key in dictionary
- Change the selected value of a drop-down list with jQuery
- Changing data structure representation at runtime looking for other examples
- Changing the tick frequency on the x or y axis
- Check if 2 tree nodes are related ancestor/descendant in O1 with pre-processing
- Check if a Bash array contains a value
- Check if a binary tree is a mirror image or symmetric
- Check if a given key already exists in a dictionary
- Check if a given key already exists in a dictionary and increment it
- Check if a list is a rotation of another list that works with duplicates
- check if a tree is a binary search tree
- Check if a value exists in ArrayList
- Check if a value is in an array C
- Check if all elements in a list are equal
- Check if all elements in a list are equal
- Check if an array contains any element of another array in JavaScript
- Check if any item in a list matches any item in another list
- Check if array B is a permutation of A
- Check if edge is included in SOME MST in linear time non-distinct values
- Check if item is in an array / list
- Check if list contains element that contains a string and get that element
- Check if one list contains element from the other
- Check if optional array is empty
- Check if optional array is empty
- Check if something is not in a list in Python
- Check if sum possible in array
- Check if two arrays are cyclic permutations
- Check if two linked lists merge. If so, where?
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