tHe puZZlingG wOrlD

A collection of "interesting" data structure and algorithm questions

Saturday, June 4, 2011

Dynamic programming references

http://www.cs.uiuc.edu/class/fa08/cs573/lectures/05-dynprog.pdf
http://www.csee.ogi.edu/class/cs532/10.pdf
http://web.iiit.ac.in/~avidullu/pdfs/dynprg/Dynamic%20Programming%20Lesson.pdf
http://www.youtube.com/watch?v=V5hZoJ6uK-s
http://geeksforgeeks.org/?p=12635
http://geeksforgeeks.org/?p=12819
Posted by Nimesh Bhagat at 9:20 PM
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Total Pageviews

SUBSCRIBE TO

Posts
Atom
Posts
Comments
Atom
Comments

Popular Posts

  • Good sites for questions
    http://gurmeetsingh.wordpress. com/puzzles/ http://www.khanacademy.org/ # brain teasers section http://pratikpoddarcse. blogspot.com/ http:...
  • How does gdb work ? part 2
    The magic behind INT 3 BACK TO TOC It is time to dig a bit into subject that is not adored by most of the programmers and that is assembler ...
  • Length of the longest substring without repeating characters
    Source Given a string, find the length of the longest substring without repeating characters. For example, the longest substrings without...
  • Part 2: How inheritance, encapsulation and polymorphism work in C++
    Source What if we try something even more complicated BACK TO TOC The thing is that you can’t. Lets say we try to create even more complica...
  • Ant Collision
    Source Puzzle : Peter and Cynthia stand at each end of a straight line segment. Peter sends 50 ants towards Cynthia, one after another. Cynt...
  • Part 1: How inheritance, encapsulation and polymorphism work in C++
    Source How inheritance, encapsulation and polymorphism work in C++ Posted on September 18, 2008, 6:15 pm, by Alexander Sandler, under Pro...
  • Normalize a path by removing redundant separators and resolving up-level references
    Write a function to normalize a path by removing redundant separators and resolving up-level references.  I.e., given "/foo/bar//./ba...
  • Computer Binomial Coefficient
    Source Following are common definition of  Binomial Coefficients . 1) A  binomial coefficient  C(n, k) can be defined as the coefficient...
  • Count smaller elements on right side
    Source Write a function to count number of smaller elements on right of each element in an array.  Given an unsorted array arr[] of disti...
  • Distance Maximizing Problem
    Source Given an array arr[], find the maximum j – i such that arr[j] > arr[i]. Examples: Input: {34, 8, 10, 3, 2, 80, 30, 33, 1} Outp...

Blog Archive

  • ►  2012 (21)
    • ►  March (6)
    • ►  February (6)
    • ►  January (9)
  • ▼  2011 (59)
    • ►  December (9)
    • ►  November (3)
    • ►  October (2)
    • ►  September (1)
    • ►  August (15)
    • ►  July (6)
    • ▼  June (8)
      • Time complexity
      • Program to count number of set bits in an (big) array
      • A binary tree problem - Populating next right poin...
      • Print Edge Nodes (Boundary) of a Binary Tree
      • A Boolean Array Puzzle
      • Distance Maximizing Problem
      • Dynamic programming references
      • The ugly number
    • ►  April (1)
    • ►  March (14)

About Me

Nimesh Bhagat
View my complete profile

Followers

Subscribe To

Posts
Atom
Posts
Comments
Atom
Comments
Simple theme. Theme images by luoman. Powered by Blogger.