Complexity & Performance questions and answers
Big O, time and space trade-offs, and making code faster. Page 17 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 961-1020
- How can I add an optional input to a graph in TensorFlow?
- How can I algorithmically determine optimal block placement in a Block Blast-style puzzle solver?
- How can I benchmark the performance of C code?
- How can I capture time lag of an event passed through various components in a distributed system?
- How can I combine two HashMap objects containing the same types?
- How can I compile a .NET application to native code?
- How can I configure the heap size when starting a Spring Boot application with embedded Tomcat?
- How can I convert this foreach code to Parallel.ForEach?
- How can I corral a method which may contain it's own async calls without having write access to the file?
- How can I determine what core a Java thread is running on?
- How can I distinguish between high- and low-performance cores/threads in C?
- How can I enrich a Convolutional Neural Network with meta information?
- How can I explicitly free memory in Python?
- How can I find a number which occurs an odd number of times in a SORTED array in On time?
- How can I find the maximum sum of a sub-sequence using dynamic programming?
- How can I find the shortest path between 100 moving targets? Live demo included.
- How can I find the time complexity of an algorithm?
- How can I find the time complexity of an algorithm?
- How can I get the size of a MySQL database?
- How can I get the sizes of the tables of a MySQL database?
- How can I get the sizes of the tables of a MySQL database?
- How can I implement two sort keys in Dynamo DB?
- How can I improve async data retrieval and caching?
- How can I improve this algorithm for solving a modified Postage Stamp puzzle?
- How can I induce long full GC pause in jvm application?
- How can I limit Parallel.ForEach?
- How can I list all foreign keys referencing a given table in SQL Server?
- How can I make a weak protocol reference in 'pure' Swift without objc
- How can I measure the actual memory usage of an application or process?
- How can I measure the speed of code written in Java? AI algorithms
- How can I measure thread stack depth?
- How can i optimize MySQL's ORDER BY RAND function?
- How can I prevent synchronous continuations on a Task?
- How can I profile a multithread program in Python?
- How can I programmatically determine how to fit smaller boxes into a larger package?
- How can I read large text files line by line, without loading them into memory?
- How can I reduce the number of CPUs used by Tensorlfow/Keras?
- How can I remove all nil elements in a Swift array?
- How can I remove the platforms I do not need to compile for in .net MAUI?
- How can I run background tasks in React Native?
- How can I run Tensorflow on one single core?
- How can I solve 'ran out of gpu memory' in TensorFlow
- How can I speed up a topic model in R?
- How can I speed up deep learning on a non-NVIDIA setup?
- How can I speed up Python's 'unittest' on multicore machines?
- How can I speed up this Keras Attention computation?
- How can I split and trim a string into parts all on one line?
- How can I stop a running MySQL query?
- How can I suppress column header output for a single SQL statement?
- How can I time a code segment for testing performance with Pythons timeit?
- How can I use 100 of VRAM on a secondary GPU from a single process on windows 10?
- How can I use async to increase WinForms performance?
- How can one test time complexity experimentally?
- How can one use multi threading in PHP applications
- How can race conditions be useful?
- How can stdmake_heap be implemented while making at most 3N comparisons?
- How can stdvector access elements with huge gaps between them?
- How can the A algorithm be applied to the traveling salesman problem?
- How can this Java code be improved to find sub-string in a string?
- How can we modify almost any algorithm to have a good best-case running time?
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