Complexity & Performance questions and answers
Big O, time and space trade-offs, and making code faster. Page 5 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 241-300
- Binary search with hint
- bisect.insort complexity not as expected
- Bit counting in a contiguous memory chunk
- Bit mask generation to minimize number of 1
- Bits counting algorithm Brian Kernighan in an integer time complexity
- Bitwise and in place of modulus operator
- Bitwise operator advantages in StringBuilder
- Blocking Methods within Task
- Bloom filter inverse? possible?
- Bomb dropping algorithm
- Boolean array reordering in O1 space and On time
- Bottom Up DP from Top Down DP
- Bowyer-Watson algorithm how to fill holes left by removing triangles with super triangle vertices
- Box stacking problem
- Boyer-Moore good-suffix heuristics
- Boyer-Moore Practical in C?
- Breadth first search the timing of checking visitation status
- Breadth First Search time complexity analysis
- Break parallel.foreach?
- Breaking out of nested loops
- build context for docker image very large
- Build trie faster
- Building and running app via Gradle and Android Studio is slower than via Eclipse
- Bypassing CloudFlare's time-out of 100 seconds
- C 64-bit loop performance on x86
- C Finding relevant document snippets for search result display
- C merge sort performance
- C non-boxing conversion of generic enum to int?
- C Out of Memory exception
- C stringfind complexity
- C Thread safe fastest counter
- Cache Oblivious algorithms for parallel programming?
- Cache oblivious lookahead array
- Caffe What can I do if only a small batch fits into memory?
- Calculate minimal operations to make two tree structures identical
- Calculate number of columns and rows needed depending on space available
- calculate precision and recall in a confusion matrix
- Calculate size of Object in Java
- Calculate the execution time of a method
- Calculate the median of a billion numbers
- Calculate the sum of elements in a matrix efficiently
- calculate turning points / pivot points in trajectory path
- Calculating a cutting list with the least amount of off cut waste
- Calculating frames per second in a game
- Calculating large factorial time complexity
- Calculating Percentiles on the fly
- Calculating the shortest route between two points
- Can a Fibonacci function be written to execute in O1 time?
- Can a program calculate the complexity of an algorithm?
- Can an array be grouped more efficiently than sorted?
- Can any finite bit string be found in pi within a reasonable amount of time?
- Can anyone explain this algorithm for calculating large factorials?
- Can evolutionary computation be a method of reinforcement learning?
- Can hash tables really be O1?
- Can I asynchronously prefetch to the GPU in tensorflow 1.4 using a two-variables approach?
- Can I force cleanup of old tombstones?
- can I limit consumption of kafka-node consumer?
- Can I load JavaScript code after the rest of page loads?
- Can I make this function more efficient Project Euler Number 9?
- Can I measure the execution time of individual operations with TensorFlow?
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