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

18,610

SUBSCRIBE TO

Posts
Atom
Posts
Comments
Atom
Comments

Popular Posts

  • Compute the minimum or maximum of two integers without branching / operators
    Source On some rare machines where branching is expensive, the below obvious approach to find minimum can be slow as it uses branching. ...
  • 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...
  • Given a dictionary of words find the ranking of characters
    You are given a dictionary with set of words i.e. in the dictionary words are arranged in special lexicographical order. The lexicographical...
  • 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...
  • 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...
  • 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 ...
  • 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...
  • 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...
  • Matrix Chain Multiplication
    Source Given a sequence of matrices, find the most efficient way to multiply these matrices together.  The problem is not actually to per...
  • Merge Two Balanced Binary Search Trees
    Source You are given two balanced binary search trees e.g., AVL or Red Black Tree. Write a function that merges the two given balanced BS...

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.