Remember
Register
Algorithms Q&A
Smart HR Software
Get the algorithms textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
Recent
Hot!
Most votes
Most answers
Most views
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(36)
Divide & Conquer
(18)
Greedy Algorithms
(10)
Dynamic Programming
(19)
Backtracking/DFS/BFS
(2)
Branch & Bound
(6)
Graph Theory
(11)
NP-Completeness
(8)
Artificial Intelligence
(28)
Randomized Algorithms
(1)
Most popular tags
recurrence-relations
time-complexity
asymptotic-analysis
loops
graph
dynamic-programming
asymptotic-notation
greedy
substitution-method
a-star
np-completeness
nested-loops
vertex-coloring
mdp
log
analysis
probability
stochastic
heuristic
master-theorem
markov-model
n-puzzle
csp
graph-coloring
mvcs
small-oh
exponent
proof
viterbi
bayes-rule
hmm
tree-search
grid-world
admissible
n-queens
conflict
ai
clique
exam
coins
reduction
dfs
prime-numbers
sqrt
count
easy
sorted-lists
logn
example
recursive
gcd
independent-set
unsolvable
pcp
counter-example
not-master-theorem
modulus
algebra
most-likely-estimate
reinforcement-learning
direct-evaluation
meu
articulation-point
hotel-room
small-omega
limit-method
mle
graph-search
while-loop
greedy-suboptimal
job-assignment
maximize-value
gold
constraint-satisfaction-problem
8-puzzle
task-environments
min-max
peak
randomized
satisfiability
random-graph-generation
proxy
network
sudoku
branchandbound
d&c
degree-constrained
spanning-tree
vertex-cover
branch
subtree
series
pmi
bound
contradiction
math
backtracking
tree
minimize
floors
Most viewed questions
+1
vote
2
answers
Canoeing on the cheap
asked
Mar 3, 2018
in
Dynamic Programming
by
jmlitfi
AlgoMeister
(
684
points)
0
votes
2
answers
Make change using smallest number of coins of given denominations
asked
Dec 3, 2016
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
dynamic-programming
0
votes
2
answers
How can we solve the 8 puzzle problem using Branch & Bound approach?
asked
Apr 9, 2019
in
Branch & Bound
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
n-puzzle
a-star
+1
vote
2
answers
Give an example of a graph without an articulation point, a Hamiltonian cycle, or a 2-coloring
asked
Jul 8, 2018
in
Graph Theory
by
basil
Active
(
340
points)
graph
vertex-coloring
graph-coloring
0
votes
3
answers
symmetry + transitivity => reflexivity, or not?
asked
Jan 18, 2016
in
Graph Theory
by
anonymous
relation
function
+4
votes
2
answers
How to find the "joint" median of 3 sorted lists, in less than linear time?
asked
Mar 5, 2016
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
median
sorted-lists
+2
votes
1
answer
Cook-Levin Theorem
asked
Dec 6, 2016
in
NP-Completeness
by
Roc6212
AlgoMeister
(
752
points)
0
votes
2
answers
Give a Proof by Induction that the sum of squares of first n natural numbers is n. (n+1). (2n + 1) / 6.
asked
May 21, 2021
in
Math Basics
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
sum
pmi
induction
proof
0
votes
2
answers
Cost Minimizing Ice Cream Shop
asked
Feb 8, 2018
in
Dynamic Programming
by
luanxy
(
132
points)
+1
vote
2
answers
What's the time complexity for solving Sudoku with backtrack method?
asked
Apr 28, 2017
in
NP-Completeness
by
shijie
Active
(
276
points)
time-complexity
backtracking
sudoku
0
votes
8
answers
Gold is a precious metal
asked
Mar 29, 2019
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
maximize-value
gold
+1
vote
2
answers
Maximize value of coins from k stacks, of n coins each
asked
Apr 9, 2019
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
coins
0
votes
2
answers
Time Complexity Analysis - Double Loop - Second increments by 0.01
asked
Aug 20, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
time-complexity
asymptotic-notation
loops
analysis
0
votes
3
answers
Time Complexity Analysis - Inner loop var gets squared
asked
Jan 15, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
analysis
loops
asymptotic-notation
time-complexity
+3
votes
1
answer
Time Complexity (3 loops with gcd)
asked
Mar 4, 2018
in
Asymptotic Analysis
by
jmlitfi
AlgoMeister
(
684
points)
loops
nested-loops
gcd
easy
0
votes
3
answers
Color this graph (n=10, m=15)
asked
Aug 15, 2016
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
vertex-coloring
greedy
+1
vote
1
answer
MVCS using Divide and Conquer
asked
Dec 3, 2016
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
mvcs
d&c
+1
vote
2
answers
Employee to project assignment reward problem
asked
Dec 4, 2016
in
Branch & Bound
by
Amal_Q
AlgoMeister
(
920
points)
0
votes
1
answer
Adjustment to Greedy Knapsack Algorithm to Guarantee Atleast 50% value of Optimal
asked
Feb 16, 2016
in
Greedy Algorithms
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
greedy
knapsack
+3
votes
1
answer
Solve the recurrence relation: T(n)=T(n/2)+T(n^0.5)+n
asked
Mar 2, 2017
in
Asymptotic Analysis
by
shijie
Active
(
276
points)
Page:
« prev
1
2
3
4
5
6
...
8
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...