Filter interviews by
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)
CodeNation interview questions for popular designations
Top trending discussions
I was interviewed before Sep 2016.
I was interviewed in Feb 2021.
Round duration - 90 minutes
Round difficulty - Medium
It is from 12 to 1:30 pm. Environment was very friendly and interviewer was very nice.
Given the first term A
, the common ratio R
, and an integer N
, your task is to find the Nth term of a geometric progression (GP) series.
The general...
Calculate the Nth term of a geometric progression series modulo 10^9 + 7.
Use the formula A * R^(N-1) to find the Nth term of the GP series.
Remember to calculate the result modulo 10^9 + 7.
Handle multiple test cases efficiently to stay within the time limit.
Round duration - 90 minutes
Round difficulty - Easy
Very friendly environment
Tip 1 : Practice DS algorithm
Tip 2 : Practice as many question you can
Tip 3 : Also practice different MCQ question
Tip 1 : Write only things you know
Tip 2 : Be truthful with your resume
I was interviewed in Jan 2021.
Round duration - 40 minutes
Round difficulty - Medium
You are provided with an array of positive integers ARR
that represents the strengths of different “jutsus” (ninja techniques). You are also given the strength of the ene...
Count the number of subarrays whose combined strength matches the given enemy strength.
Iterate through the array and maintain a running sum to check for subarrays with sum equal to the enemy strength.
Use a hashmap to store the running sum frequencies and increment the count of subarrays accordingly.
Return the count of subarrays that sum up to the given enemy strength.
Round duration - 15 minutes
Round difficulty - Easy
It was in the night around 7:00PM-7:15PM. Platform used for this round was skype. Interviewer was very friendly in nature. This round focusses more on your personality rather than knowledge.
Tip 1 : Practice Coding questions
Tip 2 : Try not to lie on resume
Tip 1 : It should not be too long or too short.
Tip 2 : Do not put false thing
I was interviewed in Nov 2020.
Round duration - 30 minutes
Round difficulty - Medium
It was conducted in morning around 8:00AM-8:40AM. Platform used for this round was hackerrank. Questions were of moderate level. Total number of mcq are 20.
Given an array ARR
of size N
consisting of distinct elements, your task is to determine the total number of good subsets. A subset is considered a good subset if the e...
Count the total number of good subsets in an array where elements can be rearranged to divide the next element.
Iterate through all possible subsets of the array.
Check if each subset is a good subset by rearranging elements to divide the next element.
Count the number of good subsets and return the total count.
Round duration - 15 minutes
Round difficulty - Easy
It was conducted in afternoon around 2:00PM-2:30PM. Platform used for this round was google meet. Interviewer was looking very serious in questioning.
Tip 1 : Research in depth about the company.
Tip 2 : Resume should be in proper format and nice looking.
Tip 3 : Time management is crucial.
Tip 1 : It should be crisp.
Tip 2 : Do not put false things on resume.
I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.
Leetcode medium questions was asked on hackerrank
A database is a structured collection of data, while system design involves creating a plan for how different components of a system will work together.
Database is used to store and organize data in a structured manner.
System design involves creating a plan for how different components of a system will interact and work together efficiently.
Examples of databases include MySQL, PostgreSQL, and MongoDB.
Examples of system...
I applied via Campus Placement and was interviewed in Nov 2021. There were 2 interview rounds.
based on 5 reviews
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