LinkedIn

It had an online assessment. The questions were directly from Codeforces. There was a difficult question with modular inverse. It was a PNC (permutations and combinations) question. I kind of did it using DP but was wrong. I read about Fermat's Lit

HackerRank test, an online technical interview with two rounds, and one HR round interview. Questions were from DSA only, not from other core subjects like OOPs, DBMS, and so on.

OA had 3 DSA questions; all were doable LeetCode mediums. Round 1: 2 DSA questions * Q1: Sort 2 sorted arrays without using extra space. This is a standard LeetCode question. Solve this in a single pass and handle all edge cases. I had a bug here