Good growth, good learning.
Sometimes work becomes unmanageable, with no extra perks.
It was good. He first introduced himself and directly jumped into DSA problems. The first question was the maximum branch sum in a binary tree. The second was to reverse a stack without using extra space.
Online Assessment (OA) that covered two key areas: DSA (Data Structures & Algorithms): Typical competitive-programming style problems such as arrays, strings, trees, graphs, dynamic programming, etc. Often includes time/space complexity considerat
The interview started with your current role and extras from daily work. What is a good skill, and how are you good in DSA and algorithms? There were two rounds scheduled. I was screened out after the second round.
It was good. He first introduced himself and directly jumped into DSA problems. The first question was the maximum branch sum in a binary tree. The second was to reverse a stack without using extra space.
Online Assessment (OA) that covered two key areas: DSA (Data Structures & Algorithms): Typical competitive-programming style problems such as arrays, strings, trees, graphs, dynamic programming, etc. Often includes time/space complexity considerat
The interview started with your current role and extras from daily work. What is a good skill, and how are you good in DSA and algorithms? There were two rounds scheduled. I was screened out after the second round.