Coding Round 1

2 questions:

• 1 Easy
• 1 DP

The DP question was unnecessarily hard, requiring 2D DP with bit masking. The interviewer was fairly new, with about 3 years of experience, and was dead set on the optimal solution for the hard DP problem. If you're interviewing with LinkedIn, make sure to blindly memorize LeetCode solutions in case you get a junior interviewer.

1. Given a boolean matrix, find the influencer. An influencer is a person who does not follow anyone but is followed by everyone else. a[i][j] means i follows j. a[i][i] is guaranteed to be false.

2. Given an array of random integers, return if this array can be divided into k subsets where the sum of each subset is equal.