Complexity & Performance questions and answers
Big O, time and space trade-offs, and making code faster. Page 11 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 601-660
- Efficient multiplication of very large matrices in MATLAB
- Efficient Packing Algorithm for Regular Polygons
- Efficient Path finding algorithm avoiding zigzag's
- Efficient queue in Haskell
- Efficient recursive random sampling
- Efficient string truncation algorithm, sequentially removing equal prefixes and suffixes
- Efficient substring Search in DynamoDB
- Efficient time and space complexity data structure for dense and sparse matrix
- Efficient use of reflection in C
- Efficient way to compare two arrays
- Efficient way to compute number of hits to a server within the last minute, in real time
- Efficient Way to Find Pair Orderings?
- Efficient way to insert a number into a sorted array of numbers?
- Efficient way to remove half of the duplicate items in a list
- efficient way to represent a lower/upper triangular matrix
- Efficient way to store millions of arrays, and perform IN check
- Efficiently computing a - K / a K with improved accuracy
- Efficiently determine the parity of a permutation
- Efficiently find all connected induced subgraphs
- efficiently find amount of integers in a sorted array
- Efficiently find an integer not in a set of size 40, 400, or 4000
- Efficiently find binary strings with low Hamming distance in large set
- Efficiently finding duplicates in a list
- Efficiently grab gradients from TensorFlow?
- Efficiently implementing erode/dilate
- Efficiently querying one string against multiple regexes
- Efficiently randomly shuffling the bits of a sequence of words
- Efficiently summing log quantities
- Efficiently using a rate-limited API Echo Nest with distributed clients
- Elastic Beanstalk disable health state change based on 4xx responses
- Eliminating cyclic flows from a graph
- Empirically estimating big-oh time efficiency
- Entity Framework async operation takes ten times as long to complete
- Entity Framework Core leaving many connections in sleeping status
- Entity Framework hangs when using async calls
- Entity Framework is Too Slow. What are my options?
- Enumerating all paths in a directed acyclic graph
- Environment.TickCount vs DateTime.Now
- Envoy proxy is using too much memory
- Equal sum subsets hybrid
- Error java.lang.OutOfMemoryError GC overhead limit exceeded
- Error when profiling keras models
- Estimating/forecasting download completion time
- Evaluation Calculate Top-N Accuracy Top 1 and Top 5
- Evenly spacing views using ConstraintLayout
- Exact time measurement for performance testing
- Example of a factorial time algorithm O n
- Example of Big O of 2n
- Example of On?
- Examples of Algorithms which has O1, On log n and Olog n complexities
- EXC_BAD_ACCESS signal received
- Exclude a column using SELECT * [except columnA] FROM tableA?
- Execute web service method and return immediately
- Executing tasks in parallel
- Execution algorithm recursively seeking lower number, is very slow
- Executors.newCachedThreadPool versus Executors.newFixedThreadPool
- Existing tools to find unused tables in cassandra cluster
- Explain why time complexity for summing digits in a number of length N is OlogN
- Explaining computational complexity theory
- External shuffle shuffling large amount of data out of memory
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