Complexity & Performance questions and answers
Big O, time and space trade-offs, and making code faster. Page 9 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 481-540
- Difference between break and continue statement
- Difference between destructor, dispose and finalize method
- Difference between Divide and Conquer Algo and Dynamic Programming
- Difference between FetchType LAZY and EAGER in Java Persistence API?
- Difference between on-heap and off-heap
- Difference between On and Ologn - which is better and what exactly is Ologn?
- Difference between storing an ObjectId and its string form, in MongoDB
- difference between subquadratic and quadratic algorithm
- Difference between tf.clip_by_value and tf.clip_by_global_norm for RNN's and how to decide max value to clip on?
- Differences between time complexity and space complexity?
- Different decision tree algorithms with comparison of complexity or performance
- Different latency time when measured through javascript vs developer console
- Dijkstra vs. Floyd-Warshall Finding optimal route on all node pairs
- Dijkstra's Algorithm modification
- Directed maximum weighted bipartite matching allowing sharing of start/end vertices
- Disable redis when many timeouts using spring boot
- Disabling Timer Coalescing in OSX for a given process
- Dispatcher.Invoke 'hangs' during asynchronous read in Windows Service
- Dispose, when is it called?
- Disposing WPF User Controls
- DisProving that one algorithm works faster than another due to language internals
- Distribute points on a circle as evenly as possible
- Distributed Hash Tables Preventing nodes from storing petabytes of data?
- Distributed Load testing using Gatling tool
- Distributed systems and choosing the nearest datacenter
- divide list in two parts that their sum closest to each other
- Divide the list into three lists such that their sum are close to each other
- Dividing an array into K subsets such that sum of all subsets is same using bitmasksDP
- Django Calculate the Sum of the column values through query
- Do event handlers stop garbage collection from occurring?
- Do I have to specify a variable for each identical argument in String.format?
- Do I need to disable NSLog before release Application?
- Do I set properties to nil in dealloc when using ARC?
- Do if statements affect in the time complexity analysis?
- Do iterative and recursive versions of an algorithm have the same time complexity?
- Do javascript loaders replace the need to do script combining?
- Do keeping cassandra fetch limit low make any improvement in performance?
- Do minimum depth, spanning trees algorithms exist?
- Do problem constraints change the time complexity of algorithms?
- Do sealed classes really offer performance benefits?
- Do variables declared in loop make space complexity ON?
- Do we need to use beam search in training process?
- Do you need to dispose of objects and set them to null?
- Docker build taking too long when installing grpcio via pip
- Docker Desktop for Windows always getting stuck on extracting
- Docker does not free memory after creating and deleting files with PHP
- Docker is extremely slow when running Laravel on Nginx container wsl2
- Document similarity Vector embedding versus Tf-Idf performance?
- Does a HashMap with string keys really have a lower time complexity than a Trie?
- Does a lambda expression create an object on the heap every time it's executed?
- Does a UNIQUE constraint automatically create an INDEX on the fields?
- Does Big O Measure Memory Requirments Or Just Speed?
- Does config.gpu_options.allow_growthTrue reduce performance in the long run?
- Does cudaFree after asynchronous call work?
- Does EarlyStopping in Keras save the best model?
- Does frequently executing DDL affect the data synchronization speed in Syncer?
- Does GPGPU fall under the distributed and/or shared memory computing paradigm(s)?
- Does Java allow a volatile read to be optimized away if the value isn''t needed, also removing the happens-before synchronization?
- Does Java Garbage Collect always has to Stop-the-World?
- Does make sense use dynamic learning rate in AdamOptimizer?
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