Good for freshers. Easy work.
The work environment is not good.
3 technical rounds (domain specific) 1 DS Algo round 1 managerial round The DS Algo round featured medium LeetCode questions. The technical rounds were also medium level, asking very basic questions. One round required developing a sample app.
Round 1: 1. Find the longest substring with non-repeating characters. 2. Find the longest subarray with a sum equal to 0. Round 2: Mostly HR-based and resume grilling.
Question: Given a string containing opening and closing parentheses, check if it is balanced. A string is considered balanced if each opening parenthesis has a corresponding closing parenthesis in the correct order. For example: Input: "(({}[()]))
3 technical rounds (domain specific) 1 DS Algo round 1 managerial round The DS Algo round featured medium LeetCode questions. The technical rounds were also medium level, asking very basic questions. One round required developing a sample app.
Round 1: 1. Find the longest substring with non-repeating characters. 2. Find the longest subarray with a sum equal to 0. Round 2: Mostly HR-based and resume grilling.
Question: Given a string containing opening and closing parentheses, check if it is balanced. A string is considered balanced if each opening parenthesis has a corresponding closing parenthesis in the correct order. For example: Input: "(({}[()]))