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

  • Simulating final class in C++
    Source Ever wondered how can you design a class in C++ which can’t be inherited. Java and C# programming languages have this feature buil...
  • 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 ...
  • 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...
  • Vertical Sum in a given Binary Tree
    Source Given a Binary Tree, find vertical sum of the nodes that are in same vertical line. Print all sums through different vertical line...
  • 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 ...
  • How does gdb work ? part 2
    The magic behind INT 3 BACK TO TOC It is time to dig a bit into subject that is not adored by most of the programmers and that is assembler ...
  • 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...
  • 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...
  • Finding the Minimum Window in S which Contains All Elements from T
    Source P roblem Find the smallest window in a string containing all characters of another string Given two strings string1 and string2 , fin...
  • 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.