Algorithms questions and answers
Sorting, searching, recursion, graphs and dynamic programming. 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
- Efficiently find binary strings with low Hamming distance in large set
- Efficiently finding duplicates in a list
- Efficiently finding the largest surrounding square in 2D grid
- Efficiently getting all divisors of a given number
- Efficiently implementing erode/dilate
- Efficiently randomly shuffling the bits of a sequence of words
- Efficiently selecting a set of random elements from a linked list
- Efficiently sorting a numpy array in descending order?
- Election Algorithms - A ring algorithm
- Elegant Python code for Integer Partitioning
- Elegant way to find closest value in a vector from above
- Elegant/Clean special case Straight-line Grid Traversal Algorithm?
- Eliminating cyclic flows from a graph
- Embedding lookup table doesn't mask padding value
- Empirically estimating big-oh time efficiency
- enet works but not when run via carettrain
- Ensuring a partially connected digraph is strongly connected
- Enumerating all paths in a directed acyclic graph
- Enumerating all paths in a tree
- Eppstein's algorithm and Yen's algorithm for k shortest paths
- Epsilon and learning rate decay in epsilon greedy q learning
- Equal sum subsets hybrid
- Equivalence classes and union/find in a functional language
- Error calculating pi using the Chudnovsky algorithm - Java
- Estimate the minimum Distance between two Clusters
- Eugene Myers' Diff Algorithm Finding the Longest Common Subsequence of A and B
- Euler project 18 approach
- Evenly distributing n points on a sphere
- Evenly distributing n points on a sphere
- Example of a factorial time algorithm O n
- Example of Big O of 2n
- Example of implementation of Baum-Welch
- Example of On?
- Examples of Algorithms which has O1, On log n and Olog n complexities
- Examples/Illustration of Wait-free And Lock-free Algorithms
- Execution algorithm recursively seeking lower number, is very slow
- Expand a random range from 1–5 to 1–7
- Explain how recursion works in an algorithm to determine depth of binary tree?
- Explain markov-chain algorithm in layman's terms
- Explain the implementation of Euler's Totient Implementation
- Explain this On log n algorithm for the Cat/Egg Throwing Problem
- Explain this snippet which finds the maximum of two integers without using if-else or any other comparison operator?
- Explain using xor to find two non-duplicate integers in an array
- Explain why time complexity for summing digits in a number of length N is OlogN
- Explaining computational complexity theory
- Explaining the AdaBoost Algorithms to non-technical people
- Explaining The Count Sketch Algorithm
- Explanation for recursive implementation of Josephus problem
- Explanation of Algorithm for finding articulation points or cut vertices of a graph
- Explanation of Merge Sort for Dummies
- Exposé Layout Algorithm
- Extending Python's os.walk function on FTP server
- Extracting 2 numbers n times and placing back the addition in On instead of Onlogn
- Extreme optimization of integer binary search
- Extremely fast method for modular exponentiation with modulus and exponent of several million digits
- Face clustering using Chinese Whispers algorithm
- Facemash algorithm
- Factorial-time algorithms and P/NP
- Factorial Algorithms in different languages
- Factorial of a large number in python
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