Complexity & Performance questions and answers
Big O, time and space trade-offs, and making code faster. Page 3 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 121-180
- Anatomy of a Memory Leak
- Android - Prevent white screen at startup
- Android - Prevent white screen at startup
- Android allow portrait and landscape for tablets, but force portrait on phone?
- Android Fatal signal 11 SIGSEGV at 0x636f7d89 code1. How can it be tracked down?
- Android how many threads can I have going?
- Android Preventing Double Click On A Button
- Android splash screen image sizes to fit all devices
- Android Studio Google JAR file causing GC overhead limit exceeded error
- Android Studio gradle takes too long to build
- Androidjava.lang.OutOfMemoryError Failed to allocate a 23970828 byte allocation with 2097152 free bytes and 2MB until OOM
- AngularJS Avoid calling same REST service twice before response is received
- Ant colony optimization using .NET
- Any decent C profilers out there?
- Any pseudo-polynomial algorithm for bounded 0-1 multi-knapsack?
- Apache curator latencies high for distributed lock
- Apache Kafka Streams Materializing KTables to a topic seems slow
- App restarts rather than resumes
- Appointment scheduling algorithm N people with N free-busy slots, constraint-satisfaction
- ARC - The meaning of __unsafe_unretained?
- Are 2n and n2n in the same time complexity?
- Are algorithms with high time complexity ever used in the real world for small inputs?
- Are CNAMES slow?
- Are list-comprehensions and functional functions faster than for loops?
- Are nested intervals a viable solution to nested set modified pre-order traversal RDBMS performance degredation?
- Are there any better methods to do permutation of string?
- Are there any cases where you would prefer a higher big-O time complexity algorithm over the lower one?
- Are there any real Onn algorithms?
- Are there any worse sorting algorithms than Bogosort a.k.a Monkey Sort?
- Are tuples more efficient than lists in Python?
- Are volatile variable 'reads' as fast as normal reads?
- Are whiletrue loops so bad?
- Arrange array so adjacent has less space that gives minimum sum
- Arrange letters of a sentence in a minimum area?
- Array maximum difference algorithm that runs in On?
- Array of 10000 having 16bit elements, find bits set unlimited RAM - Google interview
- Array or List in Java. Which is faster?
- Arrays Find minimum number of swaps to make bitonicity of array minimum?
- As distributed caching requires network call, isn''t it beneficial to read directly from the DB in some cases?
- Assurance of ICP, internal Metrics
- Async-Await vs ThreadPool vs MultiThreading on High-Performance Sockets C10k Solutions?
- async await blocking ui wp8
- Async Await performance - Direct method call vs Task wrapper call
- Async loading inside cshtml page
- async task progress dialog show too late
- async Task then await Task vs Task then return task
- Asynchronous AOF fsync is taking too long (disk is busy?). Writing the AOF buffer without waiting for fsync to complete, this may slow down Redis
- Asynchronous google ads versus Synchronous
- Asynchronous io in c using windows API which method to use and why does my code execute synchronous?
- Asynchronous Performance Tests with XCTest
- Asynchronous queries in a web app, using NHibernate
- At which n does binary search become faster than linear search on a modern CPU?
- Attempted to read or write protected memory. This is often an indication that other memory is corrupt
- Attribute to Skip over a Method while Stepping in Debug Mode
- Avoid certain parameter combinations in GridSearchCV
- avoid rebuilding node_modules in elastic beanstalk
- Avoid synchronized(this) in Java?
- await Task.Delay takes longer than expected
- AWS Athena too slow for an api?
- AWS EBS Volume in-use - optimizing
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