Popular Posts

  • Amazon "Bar Raiser" Interview Question
    Given the sequence  S1  = {a,b,c,d,…,x,y,z,aa,ab,ac…. } and given that this sequence corresponds (term for term) to the sequence  S2  = {0,1...
  • Maximum size square sub-matrix with all 1s
    Given a binary matrix, find out the maximum size square sub-matrix with all 1s. Algorithm: Let the given binary matrix be M[R][C]. The idea ...
  • The Sports Stadium
    The bustling town of Siruseri has just one sports stadium. There are a number of schools, colleges, sports associations, etc. that use this ...
  • Shell sort
    Refer :  http://education.cdacmumbai.in/education/pgdst/dsalfac/notes/ShellSort.pdf Shellsort works by comparing elements that are distant r...
  • Gmail Multiple User Names...
    Many of you might not be knowing that if you have 1 gmail id … you have infinte gmail ids… Seems to be a joke.. It’s not actually… for e.g ...
  • Find Kth largest and smallest number in BST
    How to find  kth  smallest element in BST . you cannot use static/global variable and you cannot pass value of k to any function ? Solution ...
  • Maximum Area Rectangle In Histogram
    Find the maximum rectangle (in terms of area) under a histogram in linear time. I mean the area of largest rectangle that fits entirely in t...
  • Maximum Difference In An Array
    There is an integer array consisting positive and negative integers. Find maximum positive difference S defined as: O(N) solution S  = a[i] ...
  • 3 sum and 2 sum problem
    Q: Given an integer x and an unsorted array of integers, describe an algorithm to determine whether two of the numbers add up to x. If we ha...
  • Remove duplicate nodes in Binary Search Tree
    http://effprog.blogspot.com/2011/02/duplicate-removal-in-binary-search-tree.html http://shashank7s.blogspot.com/2011/03/write-program-to-rem...

Wednesday, March 23, 2011

Avid TV Watcher

Here is a TV avid person. He wants to spend his max time on TV. There are N channels with different program of different length and diff times. WAP so that the person can spend his max time watching TV.Precondition: If that person watches a program, he watches it completely.

Ex:
Channel1: 
prog1 – 8:00- 8:30
prog2: 9:00 – 10:00
prog3: 10:15 – 12:00

channel2: 
prg1 – 8:15 – 10:00
prg2: 10:30 – 12:00

So in this case max time will be if he watches:

ch2/prg1 + ch1/prg3


http://tech-queries.blogspot.com/2011/03/avid-tv-watcher.html
Posted by at
Labels: ,

2 comments:

  1. rajeevprasannaMarch 29, 2011 at 3:55 AM

    http://tech-queries.blogspot.com/2009/05/number-of-bus-stations.html

    ReplyDelete
  2. AkashApril 14, 2011 at 4:27 AM

    Hey Rajeev,

    Thanks for sharing the link. Now this blog has FB presence as well.
    http://www.facebook.com/ProgrammingInterviews/

    ReplyDelete

Subscribe to: Post Comments (Atom)