Filter interviews by
It was a DS and Algo round.
I appeared for an interview in Dec 2021.
Round duration - 90 minutes
Round difficulty - Medium
Time duration - 1.5 hour, (10 mins window to login for test)
No. of coding Question - 3 (2 medium, 1 hard)
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...
The problem is to connect N ropes of different lengths into one rope with minimum cost.
Sort the array of rope lengths in ascending order.
Initialize a variable to keep track of the total cost.
While there are more than one rope remaining, take the two shortest ropes and connect them.
Add the cost of connecting the two ropes to the total cost.
Replace the two shortest ropes with the connected rope.
Repeat the above steps unt...
Round duration - 90 minutes
Round difficulty - Medium
Major Focus - Data structure, Algorithms, Competitive Programming
Point To Remember - All questions in this round were asked to explain, implement, explain and tell time and space complexity, optimise if possible
No. of candidates shortlisted - 26
Determine if a given graph is bipartite. A graph is bipartite if its vertices can be divided into two independent sets, 'U' and 'V', such that every edge ('u', 'v') conne...
The function checks whether a given graph is bipartite or not.
A bipartite graph can be divided into two independent sets such that every edge connects a vertex from one set to the other.
We can use graph coloring algorithm to check if the graph is bipartite.
Start by coloring the first vertex with one color and all its neighbors with the other color.
Continue coloring the remaining vertices, making sure that no adjacent v...
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...
The task is to find all the different possible substrings of size two that appear in a given string as contiguous substrings.
Iterate through the string and extract substrings of size two
Store the substrings in an array
Return the array of substrings
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GR...
The question asks to print the DFS traversal of an undirected and disconnected graph.
Implement a Depth First Search (DFS) algorithm to traverse the graph.
Use a visited array to keep track of visited vertices.
For each unvisited vertex, start a DFS traversal and print the connected component.
Sort the vertices of each connected component in ascending order before printing.
Tip 1 : have good hands on data structure and algorithms and competitive programming
Tip 2 : strong knowledge of core subjects of dbms, os and oops ( know less topic but in depth)
Tip 3 : your resume should speak about your skills and personality
Tip 1 : Know your resume - you are what you write in your resume
Tip 2 : should definately contain - Details, Education, Experience, Skills
Tip 3 : Additional Section - awards, certifications, publications, patents, volunteer work, extra curricular activities, hobbies
Tip 4 : Have a habit of tuning your resume according to the job profile
Tip 5 : Platform - flowcv.io
Top trending discussions
I rate myself as proficient in programming languages with experience in Java, Python, and C++.
Proficient in Java, Python, and C++
Experience in developing applications using these languages
Familiarity with various frameworks and libraries
Ability to write efficient and optimized code
Experience in debugging and troubleshooting
Continuously learning and improving skills
A program to calculate the average of a list of numbers.
Prompt the user to enter a list of numbers separated by commas.
Split the input string into an array of numbers.
Calculate the sum of the numbers in the array.
Divide the sum by the length of the array to get the average.
Display the average to the user.
I applied via Campus Placement and was interviewed in Oct 2020. There were 4 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Aug 2021. There was 1 interview round.
posted on 12 Oct 2023
I applied via Approached by Company and was interviewed in Sep 2023. There were 4 interview rounds.
Reasoning general knowledge questions.
Logical and tricky questions.
I applied via Campus Placement and was interviewed in Jul 2024. There were 3 interview rounds.
General questions asked
I applied via Approached by Company and was interviewed before Sep 2023. There were 2 interview rounds.
Simple code on array and string
I am a recent graduate with a degree in Computer Science and a passion for software development.
Recent graduate with a degree in Computer Science
Passionate about software development
Experience with programming languages like Java and Python
based on 1 interview
Interview experience
based on 5 reviews
Rating in categories
Software Engineer
111
salaries
| ₹10 L/yr - ₹22 L/yr |
Senior Software Engineer
83
salaries
| ₹13.5 L/yr - ₹28 L/yr |
Associate Software Engineer
44
salaries
| ₹8 L/yr - ₹16 L/yr |
Lead Software Engineer
26
salaries
| ₹24 L/yr - ₹40.5 L/yr |
Senior Solution Engineer
25
salaries
| ₹12.5 L/yr - ₹20.5 L/yr |
Xoriant
Photon Interactive
CitiusTech
Iris Software