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

  • 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...
  • 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...
  • Queue that Support Push_rear, Pop_front, and GetMin in Constant Time
    Source Problem Design a queue that supports push_rear, pop_front, and get_min in O (1). Would that be elegantly possible too? Solution Maint...
  • 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. ...
  • 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...
  • 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 ...
  • Search in a row wise and column wise sorted matrix
    Source P roblem Given an n x n matrix, where every row and column is sorted in increasing order. Given a number x, how to decide whether thi...
  • 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...
  • 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/p...
  • Saving a Binary Search Tree to a File
    Source Describe an algorithm to save a Binary Search Tree (BST) to a file in terms of run-time and disk space complexity. You must be ab...

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.