Interview Question: Bonus Ranking Time

Sample Question #35 (programming – Perl)

In Perl, given a hash %bonus where the key is employee ID and the value represents the employee’s expected year-end bonus, sort this hash by value from highest bonus to lowest.

Bonus question: how would you do this whole ID–>bonus mapping and sorting in C++ or C#?

(Comment: quite a few quant shops on the Street use Perl and/or Python to work on text-based data files)

Advertisements
This entry was posted in Sample Qs. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s