Filter interviews by
I was interviewed in Jun 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Explain Higher Order Functions in javascript.
What is the difference between tag and tag?
Given an array of strings ARRSTR[]
of size N
, and a character C
, your task is to sort the ARRSTR[]
array according to a new alphabetical order that starts with the ...
Approach: The idea here is to use a data structure HashMap to store each character’s order in the new alphabetical order, starting with a letter c (given in the problem). Now, start comparing the strings in the ‘ARRSTR[]’ using HashMap that has been created to define the order.
Suppose that we are comparing two strings of ‘ARRSTR[]’ named ‘X’ and ‘Y’. Let us assume that we have found the first diff...
Round duration - 60 minutes
Round difficulty - Medium
List the different types of relationships in SQL.
What is an Alias in SQL?
You are given two arrays, 'ARR' of size 'N' and 'BRR' of size 'M'. Your task is to sort the elements of 'ARR' such that their relative order matches that in 'BRR'. Any e...
O(N), wh...
Round duration - 60 Minutes
Round difficulty - Easy
You are provided with a string STR
representing a column title in an Excel Sheet. Your task is to determine the corresponding column number.
A typica...
Round duration - 60 Minutes
Round difficulty - Easy
Tip 1 : Polite
Tip 2 : Truth
Tip 3 : Simple
Tip 1 : Consistent
Tip 2 : Keep practicing
Tip 3 : Keep on giving interview
Tip 1 : Mention All Skills
Tip 2 : One page resume enough
Top trending discussions
I applied via LinkedIn and was interviewed in Apr 2023. There were 4 interview rounds.
I applied via Monster
Just discuss about java concept and exprience
I applied via Campus Placement
2 coding questions and a few MCQs
Garbage collector in Python is a built-in feature that automatically manages memory by reclaiming unused memory space.
Garbage collector in Python helps in automatically deallocating memory of objects that are no longer in use.
It prevents memory leaks by freeing up memory that is no longer needed.
Python's garbage collector uses reference counting and a cycle-detecting algorithm to manage memory efficiently.
I applied via LinkedIn and was interviewed in Apr 2023. There were 4 interview rounds.
Question about basic engineering subjects and coding
The test was quite simple but the interviewer was not ready to accept the solution. Even with complete dry run and working output he denied the solution giving a very vague reason.
I applied via Campus Placement and was interviewed in Oct 2023. There were 2 interview rounds.
2 coding questions from dsa. one quest was from trees ds
I was interviewed in Aug 2021.
Round duration - 90 minutes
Round difficulty - Medium
This was a proctured online coding round where we had 2 questions to solve under 90 minutes . The questions were a bit lengthy but the implementation part was quite easy .
Given a text message, your task is to return the Run-length Encoding of the given message.
Run-length encoding is a fast and simple method of encoding strings, repres...
Given an array/list ARR
of integers with size 'N', your task is to determine the minimum number of increments needed to make all elements of the array distinct. You...
Round duration - 50 Minutes
Round difficulty - Easy
This Round was DS/Algo + Core round and it started with formal introduction, followed by 3 problems. We first dicussed the
approach the time complexity and proper code covering all cases for the 2 coding problems . The last question was related to OS and was a bit theoretical .
Given a string STR
, return all possible non-empty subsequences with distinct characters. The order of the strings returned is not important.
STR = ...
In this intellectual game, Ninja is provided with a string of balanced parentheses called STR
. The aim is to calculate the score based on specific game rules. If Nin...
Round duration - 40 Minutes
Round difficulty - Medium
I was given 2 preety good questions of DSA in this round . One was related to Binary Trees and the other was a good DP problem in which I struggled a bit but with some hints I was able to solve this problem too . The last question was related to OOPS and was preety easy .
Given the POSTORDER
and PREORDER
traversals of a binary tree, where the tree consists of N nodes with each node representing a distinct positive integer fr...
You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...
Round duration - 30 Minutes
Round difficulty - Easy
This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Software Engineer
1k
salaries
| ₹7.6 L/yr - ₹27 L/yr |
Senior Software Engineer
957
salaries
| ₹11.2 L/yr - ₹40 L/yr |
Analyst
220
salaries
| ₹4.2 L/yr - ₹17.9 L/yr |
Senior Analyst
220
salaries
| ₹7.3 L/yr - ₹25 L/yr |
Lead Software Engineer
164
salaries
| ₹18 L/yr - ₹60 L/yr |
Home Depot
Ace Hardware
Menards
Sherwin Williams Paints