As we talked about last time around, most interview problems for software engineering positions across the industry concern algorithms and data structures. With a bit of practice, it is possible and reasonably enjoyable to tackle these problems in Ruby. We have covered some of the basics: linked lists and hash tables. This time, we'll go a bit deeper. We'll implement an LRU cache (and explain what that is) and also look into binary trees, all in Ruby.
Continue reading %Ruby Interview Questions: LRU Cache and Binary Trees%
by Dhaivat Pandya via SitePoint
No comments:
Post a Comment