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

  • 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...
  • Backtracking 1 - Knight’s tour
    Source Backtracking is an algorithmic paradigm that tries different solutions until finds a solution that “works”. Problems which are typica...
  • How does gdb work ? part 1
    Source : http://www.alexonlinux.com/ How debugger works Introduction In this article, I’d like to tell you how real debugger works. What ha...
  • A Boolean Array Puzzle
    Source Input: A array arr[] of two elements having value 0 and 1 Output: Make both elements 0. Specifications: Following are the specific...
  • 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...
  • Find the repeating and the missing in an unsorted array
    Source Given an unsorted array of size n. Array elements are in range from 1 to n. One number from set {1, 2, …n} is missing and one numbe...
  • Understanding “extern” keyword in C
    Source Understanding “extern” keyword in C July 19, 2009 I’m sure that this post will be as interesting and informative t...
  • Good sites for questions
    http://gurmeetsingh.wordpress. com/puzzles/ http://www.khanacademy.org/ # brain teasers section http://pratikpoddarcse. blogspot.com/ http:...
  • Coin Change
    Source Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1, S2, .. , Sm} valued coins...
  • Calculate Logn in one line
    Source Write a one line C function that calculates and returns . For example, if n = 64, then your function should return 6, and if n = 12...

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.