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

  • 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...
  • Regular Expression Matching
    Source Implement regular expression matching with support for ‘.’ and ‘*’. ‘.’ Matches any single character. ‘*’ Matches zero or more of ...
  • Finding prime numbers
    Source Output all prime numbers up to a specified integer n. This is a phone screen question from one of my interviews. An efficient way to ...
  • When do we pass arguments by reference or pointer?
    Source In C++, variables are passed by reference due to following reasons: 1) To modify local variables of the caller function: A ref...
  • Check if a binary tree is subtree of another binary tree
    Source Given two binary trees, check if the first tree is subtree of the second one. A subtree of a tree T is a tree S consisting of a node...
  • Print all interleavings of given two strings
    Source Given two strings str1 and str2, write a function that prints all interleavings of the given two strings. You may assume that all ...
  • 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...
  • Maximum Length Bitonic Subarray
    Source Given an array A[0 ... n-1] containing n positive integers, a subarray A[i ... j] is bitonic if there is a k with i <= k <= ...
  • Reverse Bits - log (n)
    Source Reverse bits of an unsigned integer. There are several methods of reversing the bits of an unsigned integer. Here, we devise an algor...

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.