Recently, I had the exciting opportunity to participate in the JPMorgan Chase & Co. (Round I), and I'd love to share my experience with you all!
Basically it was screening round for the position of summer intern. (2nd year)
First Question: Substring Removal
Problem Statement:
Given a string, 'seq' that consists of the characters 'A' and 'B' only, in one move, delete either 'AB' or a 'BB' substring and concatenate the remaining substrings
Note: A substring is a contiguous subsequences of a string.
Return the minimum possible length of remaining string after performing any number of moves
Eg. seq = "BABBA", o/p = 1
Topic tags : Stack, String
Expected time complexity : O(n)
Expected space complexity : O(n)
Testcases Passed : ALL
Second Question: Jack and Jones
Problem Statement:
Jack and Jones are two hackers playing a fun game. They are a 'query' array of non-empty strings.
Each string in this array signifies a single round of the game, return the array of strings denoting winner of each round.
Game Rules :
Eg: query = ["Leetcode", "DSA", "Sphynx"], o/p = ["Jack", "Jack", "Jones"]
Note: Consider both players play each round optimally.
Topic tags : Mathematics, Simulation
Expected time complexity : O(1)
Expected space complexity : O(1)
Testcases Passed : ALL
Note:
Don't be intimidated by time/space complexities. Start by simulating the problem, then progressively optimize your algorithm. Soon, you'll get closer to achieving constant efficiencies.
Time and Space complexities and Topic tags were not provide by JPMorgan Chase and Co., by having a conversation with my college-mates, I concluded that these were probably what they were expecting.