About Me
My Projects
My Thesis
Contact Me
Get My CV
CODE POET
Algorithms
_Breadth First Search - BFS
_Depth First Search - DFS
Greedy Algo
_Activity Selection
_Fractional Knapsack
_15 Puzzle, Solvable or not
_Minimum Number of Coins
Dynamic Programming
_0 1 Knapsack Problem
_Bit-wise Sieve Method
_Minimum Edit Distence
_Longest Common Subsequence
iOS Development
Contact Me
This is contact me page.
No comments
Subscribe to:
Posts ( Atom )
Popular
C++ map STL
Strongly Connected Component (SCC)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32...
TopSort
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 ...
15 Puzzle, Solvable or not??
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 4...
Longest Common Subsequence(LCS)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 ...
Recent
5/recent-posts
Comments
Categories
algorithm
algorithms
dp
greedy
slider
sql
stl
Blog Archive
▼
2024
(3)
▼
October 2024
(3)
UVA 10018
UVA 11799
Strongly Connected Components - SCC
►
2018
(18)
►
November 2018
(1)
►
August 2018
(1)
►
July 2018
(6)
►
April 2018
(5)
►
February 2018
(5)
►
2017
(1)
►
November 2017
(1)
Tags
dp
greedy
slider
algorithm
algorithms
sql
stl
Visitors
Theme images by
Jason Morrow
. Powered by
Blogger
.
No comments