Good tech stack, great team, and work environment.
Not any as of now.
The interview was conducted in three parts. Two were technical rounds, which focused on data structures, networking, operating systems, and the projects mentioned on the resume. The third was an HR round. The interview was carried out well, and th
Maximum Sum of Non-Adjacent Elements You are given an array/list of ‘N’ integers. You are supposed to return the maximum sum of a subsequence with the constraint that no two elements are adjacent in the given array/list.
Old Java world questions, such as design patterns and Java APIs. There were 1 telephonic and 3 rounds in total. If you are good at speaking, you may get selected. What is an LRU Cache? In the first round, they asked me to work on a problem, but t
The interview was conducted in three parts. Two were technical rounds, which focused on data structures, networking, operating systems, and the projects mentioned on the resume. The third was an HR round. The interview was carried out well, and th
Maximum Sum of Non-Adjacent Elements You are given an array/list of ‘N’ integers. You are supposed to return the maximum sum of a subsequence with the constraint that no two elements are adjacent in the given array/list.
Old Java world questions, such as design patterns and Java APIs. There were 1 telephonic and 3 rounds in total. If you are good at speaking, you may get selected. What is an LRU Cache? In the first round, they asked me to work on a problem, but t