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

  • Sliding Window Maximum
    S ource P roblem A long array A[] is given to you. There is a sliding window of size w which is moving from the very left of the array to t...
  • When do we use Initializer List in C++?
    Source Initializer List is used to initialize data members of a class. The list of members to be initialized is indicated with constructor...
  • Hacking a Google interview (From MIT)
    Source » Hacking a Google Interview Course Website Directly from MIT’s course website, Learn the tricks. Beat the system. Ever wanted to wo...
  • Regular Expression Matching
    Source Implement regular expression matching with support for ‘.’ and ‘*’. ‘.’ Matches any single character. ‘*’ Matches zero or more of ...
  • Find square root of a number without using square root
    Give a number find square root of number without using square root function. Solution: So given x we need to find sqrroot(x) = y i.e. x ...
  • (no title)
    Source P roblem Given a target number, and a series of candidate numbers, print out all combinations, so that the sum of candidate numbers e...
  • 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...
  • Stack that Support Push, Pop, and GetMin in Constant Time
    Source Problem Design a stack that supports push, pop, and retrieving the minimum element in constant time. Can you do this? Solution Use ex...
  • 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 <= ...
  • 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...

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.