Complexity & Performance questions and answers
Big O, time and space trade-offs, and making code faster. Page 15 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 841-900
- For parallel algorithm with N threads, can performance gain be more than N?
- Force kafka consumer to poll partition with highest lag
- Forcing multiple threads to use multiple CPUs when they are available
- Format Float to n decimal places
- freeze some variables/scopes in tensorflow stop_gradient vs passing variables to minimize
- From an interview Removing rows and columns in an n×n matrix to maximize the sum of remaining values
- FSharp runs my algorithm slower than Python
- FTRL implementation in tensorflow V.S. FTRL in Google's research paper
- Fuel chart smoothing algorithm
- Fulltext Search with InnoDB
- Fully cover a rectangle with minimum amount of fixed radius circles
- Functional style of Java 8's Optional.ifPresent and if-not-Present?
- Game on the tree, cutting branch
- Generating a tower defense maze longest maze with limited walls - near-optimal heuristic?
- Generator expressions vs. list comprehensions
- Genetic algorithm - new generations getting worse
- Genetic algorithm and Tetris
- Genetic algorithm resource
- Get a permutation as a function of a unique given index in On
- Get a sublist from an ArrayList efficiently
- Get the biggest chronological drop, min and max from an array with On
- Get the last day of the month
- Get top n records for each group of grouped results
- Getting a low ROC AUC score but a high accuracy
- Getting around tf.argmax which is not differentiable
- Getting image dimensions without reading the entire file
- Getting the lowest possible sum from numbers' difference
- Getting the name of the currently executing method
- Getting the submatrix with maximum sum?
- Getting time elapsed in Objective-C
- Getting value of enum on string conversion
- Git Bash is extremely slow on Windows 7 x64
- Git is really slow for 100,000 objects. Any fixes?
- Git push takes forever
- Given a 1 TB data set on disk with around 1 KB per data record, how can I find duplicates using 512 MB RAM and infinite disk space?
- Given a bitonic array and element x in the array, find the index of x in 2logn time
- Given a permutation''s lexicographic number, is it possible to get any item in it in O1
- Given a sorted array, can we build a sorted array of the sums of all pairs in On2?
- Given a string of numbers and a number of multiplication operators, what is the highest number one can calculate?
- Given an array, can I find in On the longest range, whose endpoints are the greatest values in the range?
- Given an unsorted Array find maximum value of Aj - Ai where ji..in On time
- Given numbers from 1 to 232-1, one is missing. How to find the missing number optimally?
- Given two arrays, find the permutations that give closest distance between two arrays
- Given two sequences, find the maximal overlap between ending of one and beginning of the other
- Global setting for AsNoTracking?
- Go multiple len calls vs performance?
- GO statements blowing up sql execution in .NET
- Golang service running on Kubernetes EKS gets OOM killed high RES memory value, low runtime.Memstats.Alloc value
- Good algorithm for finding the diameter of a sparse graph?
- Good books and resources on data parallel programming and algorithms
- Good hash algorithm for list of memory addresses
- Good performance with Accuracy but not with Dice loss in Image Segmentation
- Good ROC curve but poor precision-recall curve
- Google Interview Find all contiguous subsequence in a given array of integers, whose sum falls in the given range. Can we do better than On2?
- Google maps polygon optimization
- Google Page Speed still giving render blocking issue even after loading resources async
- Google Play app description formatting
- GPU based algorithm on AWS Lambda
- GPU only being used 1-5 Tensorflow-gpu and Keras
- GPU PoolAllocator explodes the CPU 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