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

  • Good sites for questions
    http://gurmeetsingh.wordpress. com/puzzles/ http://www.khanacademy.org/ # brain teasers section http://pratikpoddarcse. blogspot.com/ http:...
  • 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 ...
  • Searching for Patterns
    Source Given a text txt[0..n-1] and a pattern pat[0..m-1] , write a function search(char pat[], char txt[]) that prints all occurrences of ...
  • Computer Networks course online
    Source 40 videos Total length: 39 hours Description: Lecture Series on Computer Networks by Prof. S.Ghosh,Department of Computer Science ...
  • 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...
  • 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...
  • Count smaller elements on right side
    Source Write a function to count number of smaller elements on right of each element in an array.  Given an unsorted array arr[] of disti...
  • Determine if a Binary Tree is a Binary Search Tree (BST)
    Source Write a function isBST(BinaryTree *node) to verify if a given binary tree is a Binary Search Tree (BST) or not. I have seen this q...
  • 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...
  • 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...

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.