Algorithms questions and answers
Sorting, searching, recursion, graphs and dynamic programming. Page 19 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 1081-1140
- Efficient Algorithm for Bit Reversal from MSB-LSB to LSB-MSB in C
- Efficient algorithm for converting a character set into a nfa/dfa
- Efficient algorithm for detecting cycles in a directed graph
- Efficient algorithm for finding a common divisor closest to some value?
- Efficient algorithm for finding all maximal subsets
- Efficient algorithm for finding the largest overlapping range given a list of ranges
- Efficient algorithm for Given an unsorted array of positive integers and an integer N, return N if N existed in array or the first number N
- Efficient algorithm to determine if an alleged binary tree contains a cycle?
- Efficient algorithm to find all the paths from A to Z?
- efficient algorithm to find nearest point in a graph that does not have a known equation
- Efficient algorithm to find the largest rectangle from a set of points
- Efficient algorithm to get the combinations of all items in object
- Efficient Algorithm to obtain Points in a Circle around a Center
- Efficient algorithm to randomly select items with frequency
- Efficient Algorithms for Computing a matrix times its transpose
- Efficient Array Storage for Binary Tree
- Efficient calculation of Fibonacci series
- Efficient Cartesian Product algorithm
- Efficient checking of whether a point is inside a large number of triangles in 2D
- Efficient combinations of N colored elements with restriction in the number of colors
- Efficient data structure for sparse data lookup
- Efficient Data Structure For Substring Search?
- Efficient data structure for word lookup with wildcards
- Efficient data structure that checks for existence of String
- Efficient data structure/algorithm for transliteration based word lookup
- Efficient floating-point division with constant integer divisors
- Efficient item binning algorithm itertools/numpy
- Efficient list intersection algorithm
- efficient longest common subsequence algorithm library?
- Efficient maths algorithm to calculate intersections
- Efficient method for finding KNN of all nodes in a KD-Tree
- Efficient method to get one number, which can''t be generated from any XORing combination
- Efficient minimal spanning tree in metric space
- Efficient Packing Algorithm for Regular Polygons
- Efficient Path finding algorithm avoiding zigzag's
- Efficient queue in Haskell
- Efficient recursive random sampling
- Efficient set intersection of a collection of sets in C
- Efficient string truncation algorithm, sequentially removing equal prefixes and suffixes
- Efficient way of calculating likeness scores of strings when sample size is large?
- Efficient way of iterating over true bits in stdbitset?
- Efficient way to compare two arrays
- Efficient way to compute geometric mean of many numbers
- Efficient way to compute number of hits to a server within the last minute, in real time
- Efficient way to filter out elements from stdvector
- Efficient way to find degrees of separation between two nodes in a graph
- Efficient Way to Find Pair Orderings?
- Efficient way to insert a number into a sorted array of numbers?
- Efficient way to remove half of the duplicate items in a list
- Efficient way to rotate a list in python
- Efficient way to search a stream for a string
- Efficient way to search an element
- Efficient way to store millions of arrays, and perform IN check
- Efficient ways to sort a deck of actual cards
- Efficiently check if two numbers are co-primes relatively primes?
- Efficiently computing a - K / a K with improved accuracy
- Efficiently determine the parity of a permutation
- Efficiently find all connected induced subgraphs
- efficiently find amount of integers in a sorted array
- Efficiently find an integer not in a set of size 40, 400, or 4000
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