Round 1 (f2f): Interviewer was very young and directly jumped into the question after introduction.
- Given an array find the maximum element for all the subarrays of size K
- Given two strings s1 and s2 compute the minimum number of operations required to convert s1 to s2.
- Given a string of integers ex:123405678 find all the valid IPV4 addresses that can be formed from the string given that you always start from the starting index i.e all IP address should start with index 0 in this case 1.
- There is a tank of infinite capacity and the tank is connected to a pipe of a finite length and the pipe is connected to a house….that house is connected to many houses with pipes of different length and finally drain in to a drainage…..Compute the maximum amount of water drained into the drainage at any given instance…(DFS approach and find the minimum at every path and sum all the minimums….if sum of all the minimums is greater than the source pipe volume return source pipe volume else return the sum)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.