I received an email from a recruiter because of my GitHub projects. Following that, I had two technical phone interviews.

I passed them, so I had my onsite interview two weeks later. This interview covered strings, dynamic programming, and graphs.

They were easy because I was well-prepared.

I studied a lot using TechInterviewClub and a bit of LeetCode.

Given two lowercase strings, S1 and S2, sort S1 in the same order as S2. If a character in S1 does not exist in S2, place it at the end.

For example, if S1 is "program" and S2 is "grapo", then the output should be "grrapom".