This week's book giveaway is in the Spring forum.
We're giving away four copies of Spring in Action (5th edition) and have Craig Walls on-line!
See this thread for details.
Win a copy of Spring in Action (5th edition) this week in the Spring forum!
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other all forums
this forum made possible by our volunteer staff, including ...
  • Campbell Ritchie
  • Bear Bibeault
  • Devaka Cooray
  • Liutauras Vilda
  • Jeanne Boyarsky
  • Knute Snortum
  • Junilu Lacar
  • paul wheaton
Saloon Keepers:
  • Ganesh Patekar
  • Frits Walraven
  • Tim Moores
  • Ron McLeod
  • Carey Brown
  • Stephan van Hulst
  • salvin francis
  • Tim Holloway

Salman and flowers  RSS feed

Ranch Hand
Posts: 41
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Hi Everyone,

I have a real time problem which is like:
Salman has a garden with N flower pots arranged in a row. Every morning he walks through the row and plucks flower. He targets to visit the first K pots in the row.
Find the number of different flowers that Salman would pluck on a single walk through K pots.
What is the approach of solution for this problem
Also, let me know where i can find more such problems.

Master Rancher
Posts: 3001
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Missed this puzzle completely. Hope OP is still around...

Can you elaborate in what way the flowers are different, and why he wouldn't pluck the first K flowers one day, the next K flowers the following day, until all flowers are plucked?

If you want to see similar puzzles, Google for "probability puzzles", you will find a lot of sites. A classical one is of course the three doors problem. Always funny, and it once led to a gigantic discussion in the newspapers here in Holland.
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!