Complexity & Performance questions and answers
Big O, time and space trade-offs, and making code faster. Page 20 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 1141-1200
- How many hash functions does my bloom filter need?
- How many processes does TensorFlow open?
- How many threads can I run concurrently on Windows?
- How many threads is too many?
- How much faster is NCHW compared to NHWC in TensorFlow/cuDNN?
- How much memory Kafka cluster needs?
- How much resources do sleeping and waiting threads consume
- How much space and processing will be optimized in Lucene index by storing a field as Byte instead of String for billions of documents
- How much speed is gained with RequireJS/AMD in JS?
- How OVE is equal to Obd In BFS
- How should I store GUID in MySQL tables?
- How should I use torch.compile properly?
- How slow are .NET exceptions?
- How to adapt Fenwick tree to answer range minimum queries
- how to add cache control in AWS S3?
- How to Add Numbers in a Matrix to Yield Minimum Result?
- How to add post-processing into a Tensorflow Model?
- How to analyze a java thread dump?
- How to analyze disk usage of a Docker container
- How to apply binary search Olog n on a sorted linked list?
- How to assign more memory to docker container
- How to auto scale Amazon DynamoDB throughput?
- How to avoid bottleneck performance?
- How to avoid data duplicates in ClickHouse
- How to avoid heap pointer spaghetti in dynamic graphs?
- How to avoid merging high cardinality sub-select aggregations on distributed tables
- How to avoid MySQL 'Deadlock found when trying to get lock; try restarting transaction
- How to avoid overfitting on a simple feed forward network
- How to avoid reinstalling packages when building Docker image for Python projects?
- How to build hybrid model of Random Forest and Particle Swarm Optimizer to find optimal discount of products?
- How to cache results of a Spring Data JPA query method without using query cache?
- how to calculate binary search complexity
- How to calculate bubble sort's time complexity
- How to calculate multiclass overall accuracy, sensitivity and specificity?
- How to calculate optimal batch size?
- How to calculate order big O for more complex algorithms eg quicksort
- How to calculate simple moving average faster in C?
- How to calculate the flops of a tensorflow model loaded from pb file
- How to calculate the space complexity of function?
- How to calculate time complexity of backtracking algorithm?
- How to change async method call to prevent forcing async up the call stack
- How to change edges' weight by designated rule?
- How to change max_allowed_packet size
- how to check both training/eval performances in tensorflow object_detection
- How to check if XGBoost uses the GPU
- How to choose an integer linear programming solver?
- How to choose the window size of CNN in deep learning?
- How to clear GPU memory occupied by zombie process if it's parent is init?
- How to clear GPU memory WITHOUT restarting runtime in Google Colaboratory Tensorflow
- How to clear out/delete tensors in tensorflow?
- How to clear react-native cache?
- How to code the maximum set packing algorithm?
- How to combine paths in Java?
- How to compare the performance of Android Apps written in Java and Xamarin C#? Anyway to check quantitative data (code & results)
- How to compare the performance of Android Apps written in Java and Xamarin C? Anyway to check quantitative data code results
- How to compress pointer ? eg. arbitrary bit pointer
- How to compute intersection of N sorted sets?
- How to compute the absolute minimum amount of changes to convert one sortorder into another?
- How to configure a fine tuned thread pool for futures?
- How to configure Apache Tika in a kube environment to obtain maximum throughput when parsing a massive number of documents?
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