TDD Boot Camp
10 likes5,437 views
This document discusses an algorithm called FizzBuzz and includes links to articles about it. It also discusses using a Last Recently Used (LRU) cache to track recently accessed data and remove the least recently used items when the cache reaches capacity. Code examples are provided for implementing an LRU cache using a Map data structure.
More Related Content
What's hot (7)
Viewers also liked (20)
Similar to TDD Boot Camp (20)
More from Takuto Wada (20)
Recently uploaded (20)
![Fast Screen Recorder v2.1.0.11 Crack Updated [April-2025]](https://cdn.slidesharecdn.com/ss_thumbnails/dataanalysisforbusiness-250322061148-eeff8a831-250401123246-f36be9ca-250401141614-87b01766-thumbnail.jpg?width=560&fit=bounds)
TDD Boot Camp
- 1. (a.k.a id:t-wada or @t_wada) Dec 19, 2009 @
- 19. ( )
- 23. Refactoring Green Red ) (
- 28. Refactoring Green Red ) (
- 42. Write a program that prints the numbers from 1 to 100. But for multiples of three print “Fizz” instead of the number and for the multiples of five print “Buzz”. For numbers which are multiples of both three and five print “FizzBuzz”. 1 100 3 Fizz 5 Buzz 3 5 FizzBuzz http://tickletux.wordpress.com/2007/01/24/using-fizzbuzz-to-find-developers-who-grok-coding/ http://www.aoky.net/articles/jeff_atwood/why_cant_programmers_program.htm
- 43. • • • • http://blogger.ukai.org/2007/09/itpro-challenge.html
- 44. • • • • • •
- 45. • • • • • •
- 46. • • •
- 47. • • • •
- 50. Refactoring Green Red ) (
- 53. • • • •
- 57. Map Last Recently Used (LRU) Cache Map
- 58. # lru.put(“a”, “dataA”); lru.put(“b”, “dataB”); lru.put(“c”, “dataC”); lru.get(“a”); #=> null # get lru.put(“a”, “dataA”); lru.put(“b”, “dataB”); lru.get(“a”); #=> “dataA” lru.put(“c”, “dataC”); lru.get(“b”); #=> null
- 59. LRU Cache ? ( …)
- 60. LRU Cache ? ( …)
- 61. LRU Cache ( …)