Complexity & Performance questions and answers
Big O, time and space trade-offs, and making code faster. Page 8 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 421-480
- Cost Function, Linear Regression, trying to avoid hard coding theta. Octave.
- Cost of an unused Kafka topic/partition
- Cost of len function
- CouchBase Replication Load Balancing - How to reduce the frequency of client replication attempts on failure
- Could not reserve enough space for object heap
- Count of co-prime pairs from two arrays in less than On2 complexity
- Count sum of multiples of a number below N with O1 complexity?
- Count the number of set bits in a 32-bit integer
- Counting according to query
- Counting inversions in an array
- Counting palindromic substrings in On
- Course assignment algorithm
- Create a dictionary with comprehension
- Create a list with initial capacity in Python
- Create a random permutation of 1..N in constant space
- Create an index on a huge MySQL production table without table locking
- Creating a learner object for Bayesian optimization using the mlr and mlrMBO packages example with a neural network model using the nnet package in R
- Creating a Maximal Configuration with Dynamic Programming
- Cross validation with grid search returns worse results than default
- Culling techniques for rendering lots of cubes
- Custom configuration in Load Test Visual Studio 2013 Ultimate
- Custom dealloc and ARC Objective-C
- Cutting Stock Problem
- Cycle of maximum weight in a graph
- Data structure for efficiently retrieving the nearest element from a set
- Data structure for Pattern Matching on large data
- Data structure for querying whether a given subset exists in a collection of sets
- Data structure for range query
- Data structure to find integers within a query range efficiently
- Database supporting fast approximate nearest neighbor queries
- DB Query profiling in Node.js
- DBSCAN sklearn is very slow
- Dealing with class imbalance in multi-label classification
- Dealing with "java.lang.OutOfMemoryError PermGen space" error
- dealloc in Swift
- Declaring variables inside or outside of a loop
- Deduplication , Grouping for events table at scale
- Default maximumPoolSize for HikariCP
- DEFER or ASYNC allowed on a stylesheet include?
- Delete many rows from a table using id in Mysql
- Delete sql rows where IDs do not have a match from another table
- Delete unused kafka consumer group
- Description of TF Lite's Toco converter args for quantization aware training
- design a stack such that getMinimum should be O1
- Design an efficient algorithm to sort 5 distinct keys in fewer than 8 comparisons
- Designing this algorithm a better way?
- Detect application heap size in Android
- Detecting consecutive integers in a list
- Determine if the solution can be optimally given using greedy algorithm
- Determine the combinations of making change for a given amount
- Determining the big-O runtimes of these different loops?
- Developing spring boot application with lower footprint
- DFS and BFS Time and Space complexities of 'Number of islands' on Leetcode
- Diagram connector algorithm
- Diff algorithms
- Difference between a stochastic and a heuristic algorithm
- Difference between average case and amortized analysis
- Difference between back tracking and dynamic programming
- Difference between Big-O and Little-O Notation
- Difference between Big-Theta and Big O notation in simple language
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