Summary
I interviewed for an SDE2 role at Dream11, facing two challenging technical questions. While I presented a valid approach for the first, the interviewer encouraged a more optimal solution, and I struggled to solve the second problem during the interview.
Full Experience
I had my first round interview for the SDE2 role at Dream11. The interview focused on two coding questions. For the first problem, I initially provided a basic solution involving flattening the matrix and sorting, but the interviewer prompted me for a more optimized approach. After the interview, I realized a max-heap approach could solve it more efficiently. Unfortunately, I was unable to solve the second problem involving restoring IP addresses during the given time. Despite facing several rejections recently, I'm determined to keep practicing and improving.
Interview Questions (2)
We are given a row-wise sorted matrix of size r*c, we need to find the median of the matrix. It is assumed that r*c is always odd.
Examples:
Input:
1 3 5 2 6 8 3 6 9
Output:
Median is 5
A valid IP address consists of exactly four integers separated by single dots. Each integer is between 0 and 255 (inclusive) and cannot have leading zeros.
For example, "0.1.2.201" and "192.168.1.1" are valid IP addresses, but "0.011.255.245", "192.168.1.312" and "192.168@1.1" are invalid IP addresses.
Given a string s containing only digits, return all possible valid IP addresses that can be formed by inserting dots into s. You are not allowed to reorder or remove any digits in s. You may return the valid IP addresses in any order.
Example 1:
Input: s = "25525511135"
Output: ["255.255.11.135","255.255.111.35"]
Input: s = "101023"
Output: ["1.0.10.23","1.0.102.3","10.1.0.23","10.10.2.3","101.0.2.3"]