Typical LC problems. Not that hard.

Related questions

Continue with questions that share topics or the same question type.

• DP problem: You are given several service options. For each option i, bandwidth[i] is the amount of bandwidth required, and request[i] is the number of requests that can be handled using that bandwidth. Given a maximum bandwidth limit totalBandwidth, choose a subset of the options so that the total bandwidth used does not exceed totalBandwidth, while the total number of handled requests is as large as possible. Return the maximum number of requests that can be handled.

  Other questions

• Given two strings s and t, return the minimum window substring of s that contains every character of t including duplicates, or an empty string if no such window exists. Walk through the sliding-window approach using two pointers and a character-frequency hashmap, analyze the O(|s| + |t|) time complexity, and discuss how to adapt it when t contains characters not present in s or when s arrives as a stream that cannot be fully buffered.

  Other questions

• Present a project that you worked on previously. bring diagrams but not too in depth

  Other questions

• They have a bunch of questions about string parsing, more often than not you will need to read a CSV so know how to do that, and know how to use the split function.

  Other questions