Filter interviews by
I applied via Naukri.com and was interviewed in May 2024. There was 1 interview round.
Balancing multiple projects and deadlines while maintaining quality work.
Managing competing priorities was challenging
Juggling multiple projects with tight deadlines
Maintaining high quality work under pressure
Prioritizing tasks effectively to meet deadlines
Case study on how to attract new business
Seeking new challenges and growth opportunities
Desire for career advancement
Limited growth potential in previous organization
Looking for a more challenging role
Seeking a company with a better cultural fit
Relocation or personal reasons
I targeted new customers by conducting market research, identifying potential leads, and implementing targeted marketing strategies.
Conducted market research to understand the target audience and their needs
Identified potential leads through various channels such as industry events, referrals, and online platforms
Implemented targeted marketing strategies including personalized email campaigns, social media advertising,...
I applied via Naukri.com and was interviewed in Jan 2020. There were 3 interview rounds.
Answering technical questions on Cucumber, Jenkins, TestNG, Selenium, and Core Java.
To build a job in Jenkins, create a new job and configure it to run the test suite using Maven or Gradle.
TestNG annotations like @BeforeTest and @AfterTest can be used to set up and tear down test environments.
Selenium Action Classes like Actions and Select can be used to perform complex user interactions.
The Robot class can be used to ...
I applied via Naukri.com and was interviewed before Sep 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before Jun 2021. There were 3 interview rounds.
It was conducted in college.
I appeared for an interview before Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
It comprised of general aptitude questions and two coding questions. It was an offline test.
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not attack each other.
Generate and print valid configurations where queens are placed safely.
Consider constraints and time limit for efficient solution.
Exam...
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Achieve sorting in a single scan over the array without using any extra space.
Round duration - 60 minutes
Round difficulty - Easy
After having a technical discussion about my CV. He gave me two questions to code.
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...
Find all unique contiguous substrings of size two from a given string.
Iterate through the string and extract substrings of size two
Use a set to store unique substrings
Return the set as an array of strings
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, there is a cycle in the linked list.
If one of the pointers reaches the end of the list (null), there is no cycle.
Round duration - 30 minutes
Round difficulty - Easy
This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code.
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
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.
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed before Jun 2020. There were 5 interview rounds.
I applied via Recruitment Consultant and was interviewed in Dec 2020. There were 3 interview rounds.
based on 2 interviews
Interview experience
15-25 Yrs
Not Disclosed
1-6 Yrs
Not Disclosed
18-25 Yrs
Not Disclosed
HR Recruiter
4
salaries
| ₹1 L/yr - ₹2.5 L/yr |
Senior HR Executive
3
salaries
| ₹2 L/yr - ₹4.8 L/yr |
PropTiger.com
MagicBricks
99acres
Square Yards