Algorithms questions and answers
Sorting, searching, recursion, graphs and dynamic programming. Page 12 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 661-720
- Can somebody please explain the backpropagation algorithm to me?
- Can someone help solve this recurrence relation?
- Can the bigO of an algorithm be found programmatically by analyzing its perfs?
- Can there be an algorithm faster than linear search?
- Can this leader election algorithm for two-nodes system with tolerating of the link failure be considered a major innovation?
- Can we apply the Bellman-Ford algorithm to an Undirected Graph?
- Can we compute this in less than Onn ... nlogn or n
- Can we do Quick sort with n logn worst case complexity?
- Can we solve this Sock Merchant problem in less complexity?
- Can we use binary search tree to simulate heap operation?
- Can we use Morris Traversal for postorder?
- Can we use Normal Equation for Logistic Regression ?
- Candidate Elimination Algorithm
- Candidate Elimination Algorithm
- Cannot understand this prime generator algorithm in my textbook
- Cardinal direction algorithm in Java
- case-insensitive list sorting, without lowercasing the result?
- Catalan Numbers, Recursive function time complexity
- Caterpillars and Leaves. Can we do better than Onc?
- Challenge,how to implement an algorithm for six degree of separation?
- Change priorityQueue to max priorityqueue
- Change strings to make them equal
- Changing data structure representation at runtime looking for other examples
- Changing On3 to On2 in JavaScript
- Cheap algorithm to find measure of angle between vectors
- Cheap way of calculating cubic bezier length
- Check for missing number in sequence
- Check if 2 tree nodes are related ancestor/descendant in O1 with pre-processing
- Check if a binary tree is a mirror image or symmetric
- Check if a list is a rotation of another list that works with duplicates
- Check if a permutation of a string can become a palindrome
- Check if a string is rotation of another WITHOUT concatenating
- check if a tree is a binary search tree
- Check if array B is a permutation of A
- Check if edge is included in SOME MST in linear time non-distinct values
- Check if given string can be created by a set of characters cut out from magazine article
- Check if one integer is an integer power of another
- Check if one list contains element from the other
- Check if polygon is inside a polygon
- Check if sum possible in array
- Check if the given string follows the given pattern
- Check if two arrays are cyclic permutations
- Check if two line segments are colliding only check if they are intersecting, not where
- Check if two linked lists merge. If so, where?
- Check if two unordered lists are equal
- Check whether a path is valid
- check whether a string C is an interleaving of A and B
- Checking if a bit is set or not
- Checking if all elements of a vector are equal in C
- Checking if given preorder traversal is valid BST
- Checking if two strings are permutations of each other in Python
- checking subtrees using preorder and inorder strings
- Checksum for an integer array?
- Chess Bug in Alpha-Beta
- Chess Optimizations
- Choice of programming language for learning data structures and algorithms
- Choose rectangles with maximal intersection area
- Choose the closest k points from given n points
- Choosing a multiplier for a string hash function
- Choosing random_state for sklearn algorithms
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