Algorithms questions and answers
Sorting, searching, recursion, graphs and dynamic programming. Page 18 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 1021-1080
- Does a HashMap with string keys really have a lower time complexity than a Trie?
- Does A work with negative weights as long that the heuristic is admissible?
- Does algorithm define a macro X?
- Does an algorithm exist to help detect the primary topic of an English sentence?
- Does an Enum exist for Asc or Desc ordering?
- Does anyone have a good Proper Case algorithm
- Does Big O Measure Memory Requirments Or Just Speed?
- Does Dijkstra's algorithm apply even if there is only one negative weight edge?
- Does Kafka rebalancing algorithm balance across topics?
- Does make sense use dynamic learning rate in AdamOptimizer?
- Does my algorithm for Leader Election bypasses FLP result?
- Does paxos provide true linearizable consistency or not?
- Does Python optimize tail recursion?
- Does quicksort with randomized median-of-three do appreciably better than randomized quicksort?
- Does Raft send AppendEntries with logs right after election?
- Does stdcopy handle overlapping ranges?
- Does stdcopy_n work with overlapping ranges?
- Does stdsort implement Quicksort?
- Does the dataset size influence a machine learning algorithm?
- Does the range-based 'for' loop deprecate many simple algorithms?
- Does there exist a Top Down Dynamic Programming solution for Longest Increasing Subsequence?
- Does this cause a real problem when I adopt the Raft's never commits log entries from previous terms by counting replicas rule in this situation?
- Doesn't Paxos end up with the same instructions in the exact same order?
- Dog Racing Game algorithm logic
- Dominoes matching algorithm
- Don't understand closest pair heuristic from The Algorithm Design Manual
- Door in an infinite wall algorithm
- Dots and boxes solving algorithm
- Drawing an antialiased circle as described by Xaolin Wu
- Duplicate a LinkedList with a pointer to a random node apart from the next node
- Duplicate substring searching
- Dynamic addition of queues to a rabbit listener at runtime
- Dynamic Array with O1 removal of any element
- Dynamic Nested Loop
- Dynamic Programming Algorithm for Segmented Least Squares
- dynamic programming and the use of matrices
- Dynamic programming aspect in Kadane's algorithm
- Dynamic programming Code Wars twice linear algorithm times out
- Dynamic Programming Coin Change Problems
- Dynamic Programming Sum-of-products
- Dynamic Programming Why the need for optimal sub structure
- Dynamically add new queues, bindings and exchanges as beans
- Dynamically changing the instanceindex with spring cloud stream kafka
- Dynamically updating shortest paths
- e-commerce Algorithm for calculating discounts
- Early stopping with multiple conditions
- Easiest algorithm of Voronoi diagram to implement?
- Easiest to code algorithm for Rubik's cube?
- Easiest way of checking if a string consists of unique letters?
- Easy interview question got harder given numbers 1..100, find the missing number(s) given exactly k are missing
- Easy interview question got harder given numbers 1..100, find the missing numbers given exactly k are missing
- Edit distance between two graphs
- Edit Distance in Python
- Edit distance recursive algorithm -- Skiena
- Edmonds-Karp Algorithm for a graph which has nodes with flow capacities
- Effect of randomness on search results
- Effective queries in machine learning
- Effective unique on unordered elements
- Effectively sorting when your data is distributed across different microservices
- Efficiency of crossover in genetic algorithms
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