Overall, I found this to be a very challenging experience. I struggled with the majority of the material and concepts presented, which made it difficult to keep up at times. Many of the problems required a deep understanding of the underlying principles and strong problem-solving skills, particularly in areas related to algorithms and data structures.
In hindsight, I would highly recommend dedicating significant time to studying LeetCode (LC) and Logic Puzzles (LP) in advance. Practicing these types of problems regularly would definitely help build the intuition and technical foundation needed to approach the questions more effectively. With better preparation and familiarity, especially in algorithmic thinking and pattern recognition, I believe the experience would be much more manageable and rewarding.
In summary, while it was a tough challenge, it also highlighted key areas for improvement and emphasized the importance of consistent practice.
Took about a month from start to finish, which felt longer than I expected. After a couple of initial phone screenings, I faced a challenging technical round focused on system design. It was during this round that I was asked to describe overcoming a major career challenge. Interestingly, I had just reviewed a similar framework on PracHub, which helped me articulate my thoughts clearly. Overall, I appreciated the depth of the process and ended up accepting the offer.
Interview questions [1]
Question 1
Describe Overcoming a Major Challenge in Your Career
The entire process usually takes 3–8 weeks, depending on scheduling and the specific role. Coding interviews heavily emphasize common DSA topics such as arrays, strings, trees, graphs, BFS/DFS, heaps, hash maps, and dynamic programming. System design becomes increasingly important for E4+ positions.
Interview questions [1]
Question 1
Given an array of integers and a target value, return the indices of two numbers that add up to the target
Unexpectedly, the first question in the technical round felt familiar. It was about finding a subset of strings with unique character concatenation — same problem I had worked through on PracHub a few days earlier. The interview included a recruiter screen followed by a rigorous pair of technical interviews where I tackled data structures and algorithms alongside system design concepts. After successfully answering a few more challenging DSA questions, I received an offer. The entire experience was intense but ultimately rewarding, and I happily accepted the position.
Interview questions [1]
Question 1
Given an array of strings, pick a subset whose concatenation contains no duplicate characters, and return the maximum possible length of that concatenation.
