Cute.

Inserting at 0 is not very efficient as it copies the whole string every time. It is better to simply push (to a Vec for example) and reverse everything at the end.

I like cider. :)

You should have replaced $emp_stamp$ with something that's not straight out of PostgreSQL documentation.

Other answers used tuples (your_type, opponent_type) as keys to the dict instead of plain strings.

Limiting the list of numbers to (length list) is unnecesary and requires an additional traversal of the list just to know the length. If you write [1..] Haskell is clever enough to generate the list on demand, and zip will stop as soon as one of the lists is exhausted (a property that greatly simplifies its use in Haskell).

Whenever you have the form if (condition) then True else False, it is an anti-pattern. You should simply have your function = condition, as the condition is always equal to either expression it will resolve to.

Why use the locals?

Absolutely unreadable. I like it!

I like that kind of challenge!

Poor form, utterly antipythonic. Using a lambda saves you one line at the expense
of rendering the code not only very hard to read but way past the 79 character limit
in PEP8 dictated by Guido van Rossum himself.

I am returning the right set of results but somehow the test case does not agree with the values. I am unsure of how to interpret this message:

 should return the expected results
Test Failed
@@,player_name    ,games,batting_average
→ ,Didi Gregorius ,94   ,␣0.308→0.308
→ ,Starlin Castro ,79   ,␣0.307→0.307
→ ,Aaron Judge    ,114  ,␣0.290→0.290
→ ,Aaron Hicks    ,66   ,␣0.283→0.283
→ ,Gary Sanchez   ,85   ,␣0.277→0.277
→ ,Chase Headley  ,110  ,␣0.270→0.270
→ ,Brett Gardner  ,112  ,␣0.249→0.249
→ ,Clint Frazier  ,28   ,␣0.243→0.243
→ ,Jacoby Ellsbury,74   ,␣0.240→0.240
→ ,Matt Holliday  ,88   ,␣0.229→0.229
→ ,Austin Romine  ,61   ,␣0.220→0.220

Why the CASE clause? It seems as in all cases, you return t1.str * t2.multiplier, serving no specific purpose.