u/Defiant_Let_3923

I finally landed an internship for this summer, but it was tough. I am local Indian (served NS), and I do not speak Chinese. Almost every company (except for the 1 American company I applied) asked for my Chinese proficiency. Most companies had it listed as part of their job requirements, my GPA and grades are good and yet I feel discriminated against just because I DO NOT SPEAK CHINESE!!!. We are supposed to a English speaking country, we embrace our mother tongue yes but Lee Kuan Yew embraced English so no one is discriminated against and we are better able to learn, interact and conduct business with each other, where hard work is rewarded. Even TikTok and SEA and many other big tech companies have asked for my Chinese proficiency and it just feels discriminatory. I want to work in big tech too, I thank my luck for landing a decent internship but GOSH IT SHOULD NOT BE THIS HARD.

I am looking for MapReduce questions that are similar to these. I just need more practice and need to see more patterns.

In a library system, consider a file recording the information of Books borrowed by Users. The file contains multiple lines, where each line has five fields: lineNumber, bookID, userID, date_of_borrow, date_of_return, implying the book (bookID) was borrowed by the user (userID) on the date date_of_borrow, and returned on the date date_of_return. If the book has not been returned, then date_of_return is NULL. A user may borrow the same book (bookID) multiple times. The lineNumber is an integer that starts from 1. bookID is a unique identifier for a book, and userID is a unique identifier for a user. The date format is ddmmyy.

Example lines:
1; b001; u001; 010125; 040125
2; b002; u001; 010224; 090324
3; b002; u002; 121124; 151124

Two users are considered more similar if they have borrowed more identical books (identified by bookIDs), regardless of whether the books have been returned. For instance, in the three example lines shown above, User u001 and User u002 have borrowed one identical book b002. Use MapReduce to find the pair of most similar users (namely, they have borrowed the largest number of identical books). If there are multiple pairs, just output one of them.

I am looking for MapReduce questions that are similar to these. I just need more practice and need to see more patterns.

In a library system, consider a file recording the information of Books borrowed by Users. The file contains multiple lines, where each line has five fields: lineNumber, bookID, userID, date_of_borrow, date_of_return, implying the book (bookID) was borrowed by the user (userID) on the date date_of_borrow, and returned on the date date_of_return. If the book has not been returned, then date_of_return is NULL. A user may borrow the same book (bookID) multiple times. The lineNumber is an integer that starts from 1. bookID is a unique identifier for a book, and userID is a unique identifier for a user. The date format is ddmmyy.

Example lines:
1; b001; u001; 010125; 040125
2; b002; u001; 010224; 090324
3; b002; u002; 121124; 151124

Two users are considered more similar if they have borrowed more identical books (identified by bookIDs), regardless of whether the books have been returned. For instance, in the three example lines shown above, User u001 and User u002 have borrowed one identical book b002. Use MapReduce to find the pair of most similar users (namely, they have borrowed the largest number of identical books). If there are multiple pairs, just output one of them.