Algorithms questions and answers
Sorting, searching, recursion, graphs and dynamic programming. Page 11 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 601-660
- C Finding relevant document snippets for search result display
- c GDI Edge Whitespace Detection Algorithm
- C group where algorithm
- C implementation of Google's 'Encoded Polyline Algorithm
- C List Sort by x then y
- C merge sort performance
- C Point in polygon
- C puzzle Make a fair coin from a biased coin
- C select algorithm
- c sort keeping track of indices
- C STL algorithm equal
- C using standard algorithms with strings, count_if with isdigit, function cast
- Cache Invalidation — Is there a General Solution?
- Cache Oblivious algorithms for parallel programming?
- Cache oblivious lookahead array
- Calculate minimal operations to make two tree structures identical
- Calculate the sum of elements in a matrix efficiently
- Calculating all of the subsets of a set of numbers
- Calculating factorial of large numbers in C
- Calculating Hamming Weight in O1
- Calculating large factorial time complexity
- Calculating mid in binary search
- Calculating Percentiles on the fly
- Calculating powa,b mod n
- Calculating SHA1 hash algorithm in PowerShell V2.0
- Calculating the nth digit of pi using the Bailey–Borwein–Plouffe BBP formula
- calculating the number of “inversions” in a permutation
- Calculating the shortest route between two points
- Calculating the similarity of two lists
- Calculating which tiles are lit in a tile-based game raytracing
- Calculation sine and cosine in one shot
- calendar scheduler algorithm
- Can a backtracking tail recursive algorithm be converted to iteration?
- Can a Fibonacci function be written to execute in O1 time?
- Can a program calculate the complexity of an algorithm?
- Can a program output a copy of itself
- Can all recursive functions be re-written as tail-recursions?
- Can an array be grouped more efficiently than sorted?
- Can anyone explain the deletion of Left-Lean-Red-Black tree clearly?
- Can anyone explain this algorithm for calculating large factorials?
- Can anyone simplify this Algorithm for me?
- Can anyone suggest good illumination normalization algos for face authentication. I have tried basic algos like DoG, LBP, ..?
- Can bottom-up dynamic programming be done in Lisp?
- Can diff be beaten at its own game?
- Can Dijkstra's Algorithm work on a graph with weights of 0?
- Can Dijkstra's Single Source Shortest Path Algorithm detect an infinite cycle in a graph?
- Can hash tables really be O1?
- Can I abuse a predicate to perform operations on the elements before remove_if removes them?
- Can I dispatch messages with a custom algorithm instead of round robin using RabbitMQ?
- Can I dispatch messages with a custom algorithm instead of round robin using RabbitMQ?
- Can I encode a string to an integer in a way that preserves lexicographic string closeness?
- Can I guess the appropriate epsilon for RDP Ramer-Douglas-Peucker?
- Can I make this function more efficient Project Euler Number 9?
- Can I reduce the computational complexity of this?
- can i traverse the items in a KTable from an external method
- Can I use arbitrary metrics to search KD-Trees?
- Can I use arbitrary metrics to search KD-Trees?
- can it be solved in linear time, did this in n2 time
- Can NS3 be paired with real distributed algorithms?
- Can ONN be faster than ON
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