Filter interviews by
Clear (1)
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Hard
The test was from 10 pm to 11:30 pm at night, Since we had to give the test from home so it was not an uncomfortable timing for me. The test was conducted on hackerrank. Personally I find Hackerrank a better test platform than others like Amcat or Mettle.
In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range...
Find the minimum number of fountains to activate to water the entire garden.
Iterate through the array to find the coverage of each fountain.
Keep track of the farthest coverage reached by activating fountains.
Activate the fountain that covers the farthest distance to minimize the number of fountains activated.
Given an integer array ARR
of size N
, your task is to find the total number of inversions that exist in the array.
An inversion is defined for a pair of integers in the...
Count the total number of inversions in an integer array.
Iterate through the array and for each pair of elements, check if the inversion condition is met.
Use a nested loop to compare each pair of elements efficiently.
Keep a count of the inversions found and return the total count at the end.
Given an array ARR
consisting of N
integers and a non-negative integer K
. An operation on the array replaces each element ELE
with MX - ELE
, where MX
is the maximum element of...
Given an array and a non-negative integer K, perform K operations on the array by replacing each element with MX - element, where MX is the maximum element of the array.
Find the maximum element in the array.
Perform the operation on each element K times.
Update the array after each operation.
Print the transformed array elements after K operations.
Round duration - 90 minutes
Round difficulty - Hard
This interview was at 10 am in the morning and was taken by a SDE 3 of the company who had a very great background in Competitive Coding.
The interview started with me introducing myself. The interviewer then gave me a google doc which had 2 coding questions written . He asked me to go through the first question and explain the approach. After which he asked me to code the solution as well. Same procedure was followed for the second question. The most difficult part in using Google Doc to write code is that it doesn't has automatic indentation like the code editors, so I had to put much efforts in keeping my code readable.
Given an array of positive integers, determine the number of distinct values obtained by applying the bitwise OR operation on all possible subarrays.
Count distinct values obtained by applying bitwise OR operation on all possible subarrays of an array of positive integers.
Use a set to store distinct values obtained by bitwise OR operation on all subarrays.
Iterate through all subarrays efficiently to calculate distinct values.
Optimize the solution to handle large input sizes efficiently.
Handle bitwise OR operation on subarrays using bitwise operators.
Consider using d...
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...
The task is to color a graph with two colors in a way that no two adjacent vertices share the same color.
Check if the graph can be colored using two colors without any adjacent vertices sharing the same color.
Use graph coloring algorithms like BFS or DFS to solve the problem.
If there are odd cycles in the graph, it is not possible to color the graph as described.
If the graph is bipartite, then it is possible to color t
Round duration - 60 minutes
Round difficulty - Hard
The round was at 4 pm evening. This round was taken by one of the Vice President of the company, this made me anxious from the very beginning.
The interviewer was a knowledgeable man and had great knowledge in every field. He always demanded exact answers.
The round started with my resume walk through. Then came open ended questions followed by a system design question in which I failed miserably.
Tip 1 : For company like codenation you need to be great in competitive programming as the online test is very difficult to crack
Tip 2 : Focus on leetcode during final months of preparation of interview
Tip 3 : Try to have at least 3 flagship projects in at least 2 different domains
Tip 1 : Keep the resume clean with good text to space ratio.
Tip 2 : Don't mention tech slacks that you have only a little knowledge about as it can backfire if the interviewer is good in that tech slack.
I was interviewed before Sep 2020.
Round duration - 45 Minutes
Round difficulty - Medium
This was a straight coding round with three questions , I was able to solve all 3
You are given a continuous stream of numbers, and the task is to determine the kth largest number at any moment during the stream.
A specialized data st...
Design a data structure to find the kth largest number in a continuous stream of integers.
Design a specialized data structure to handle continuous stream of numbers
Implement add(DATA) function to add integers to the pool
Implement getKthLargest() function to retrieve the kth largest number
Maintain the pool of numbers and update it based on queries
Output the kth largest number for each Type 2 query
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Recursively try moving in all directions (up, down, left, right) until reaching the destination.
Add the valid path to the result list when the destination is reached.
Sort the result list in alphabetical order before returning.
Round duration - 60 Minutes
Round difficulty - Medium
As this was my first system design round, I was not expecting to be able to tell anything , but to my surprize he interested in just the idea what I can think , how I can solve some issues which need not be definitely to have a solution / or multiple solutions are possible from common sense.
I was given an Idea based question
Tip 1 : Be focused on the question and keep trying, Project needs to be well understood and somewhat on your tips.
Tip 2 : Don't code till you are sure and got a green signal about the efficiency and correctness of logic
Tip 3 : Just brush up your DS basics and some logical algorithms (Dijkstra, Shortest spanning tree , etc)
Tip 1 : Experience must be highlighted, or the Project whichever you would like to discuss
Tip 2 : Links are always a great way to show your work (deployed/code)
Top trending discussions
I was interviewed before Sep 2020.
Round duration - 140 minutes
Round difficulty - Medium
Test timing was at 2:00 pm , it was conducted in a college and the environment was good for the test. Camera was a primary part of test, so no suspicious activity.
Given two numbers in the form of two arrays where each element of the array represents a digit, calculate the sum of these two numbers and return this sum as an ar...
Given two numbers represented as arrays, calculate their sum and return the result as an array.
Iterate through the arrays from right to left, adding digits and carrying over if necessary
Handle cases where one array is longer than the other by considering the remaining digits
Ensure the final sum array does not have any leading zeros
Round duration - 20 minutes
Round difficulty - Easy
The round was conducted at around 12 p.m. I was called at the college location and then it was conducted. The interviewer was quite polite and frank.
Round duration - 8 minutes
Round difficulty - Easy
This round was conducted right after finishing and clearing the technical round at the same place and on the same day.
Tip 1 : Practice atleast 2-3 Coding problems daily so your logic building becomes stronger.
Tip 2 : Exercise problems based on OOPS concepts and others too.
Tip 3 : If you can have your own project built, then it's the major point and will act as a plus point.
Tip 1 : Your resume should be in standard form, short and simple will be more effective.
Tip 2 : Whatever you have learned, you need to mention it in your resume as that will be your primary source of selection and having project on your resume is important.
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Job Portal and was interviewed before Apr 2021. There was 1 interview round.
Solid principles are a set of design principles for writing maintainable and scalable code in C#.
Single Responsibility Principle (SRP) - a class should have only one reason to change
Open/Closed Principle (OCP) - a class should be open for extension but closed for modification
Liskov Substitution Principle (LSP) - derived classes should be substitutable for their base classes
Interface Segregation Principle (ISP) - client...
I applied via Campus Placement and was interviewed before Feb 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
based on 1 review
Rating in categories
SDE (Software Development Engineer)
33
salaries
| ₹0 L/yr - ₹0 L/yr |
Sde1
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech