Filter interviews by
I appeared for an interview in Dec 2022.
Top trending discussions
I applied via Naukri.com and was interviewed before Jan 2021. There were 4 interview rounds.
I have managed various projects and worked on dashboards and data analysis tools.
Managed projects in previous organizations
Worked on dashboards
Skilled in data analysis tools
Used Tableau to create dashboards for sales and marketing teams
Analyzed customer data using Excel and Python
Created reports on project progress using JIRA
I applied via Walk-in and was interviewed in May 2020. There were 3 interview rounds.
I applied via LinkedIn and was interviewed before Jul 2020. There were 5 interview rounds.
I applied via LinkedIn and was interviewed in Mar 2021. There were 4 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
The test was scheduled around 5 evening and it had 3 coding questions. First question was on Dynamic Programming and other was medium question and was easy and the third was based on graph. And there were 20 mcq questions on Data structures, DBMS and OS
Explanation: You are given an 'M' x 'N' matrix of characters named CHARACTER_MATRIX
and a string WORD
. Your task is to identify and list all the occurrences of the string within...
Matrix Word Search Problem - Find occurrences of a given word in all eight possible directions within a matrix.
Iterate through each cell in the matrix and check for the starting character of the word.
For each occurrence of the starting character, check all eight directions for the complete word.
Keep track of the coordinates of each character in the word for each occurrence found.
Ensure boundaries are not crossed while ...
Round duration - 60 minutes
Round difficulty - Easy
Normal Coding question on Graphs and some basics from DBMS
Given a directed graph with 'V' vertices and 'E' edges, determine if a vertex i
is reachable from vertex j
for all pairs of vertices (i, j)
. A vertex...
Determine reachability between all pairs of vertices in a directed graph.
Use Floyd Warshall algorithm to find transitive closure of the graph.
Initialize a V x V matrix with 1s on the diagonal and 0s elsewhere.
Update matrix by checking if there is a path from i to j through k.
Repeat the process for all vertices to get the transitive closure matrix.
Round duration - 60 minutes
Round difficulty - Hard
He asked me to read about Morse language in wikepedia and asked me to write a code on it i. e. If the input Morse code and in output we should get it in English
You are provided with a string of morse code(s) of length N. Your task is to convert this morse code into the corresponding alphanumeric code consisting of lowercas...
Convert Morse code to alphanumeric code using a predefined table.
Iterate through the morse code string and convert each morse code to its corresponding alphanumeric character using the given table.
Join the converted characters to form the final alphanumeric string.
Handle spaces between morse code characters by adding a space in the final alphanumeric string.
Tip 1 : Do all the questions of interview bit atleast twice for those who are not good in coding much. And simultaneously do mcqs from geeks for geeks especially from the topics Data structures, DBMS and Operating system
Tip 2 : Do go through all the dynamic programming questions from geeks for geeks.
Tip 3 : Practice lot of questions from leetcode.
Tip 1 : Always keep your resume short
Tip 2 :Try to keep it on one page . And never put false things on resume and write only those topics that you have thorough knowledge
I applied via Recruitment Consultant and was interviewed in Mar 2021. There was 1 interview round.
based on 5 reviews
Rating in categories
Senior Quantity Surveyor
3
salaries
| ₹12 L/yr - ₹16.3 L/yr |
Assistant Structural Engineer
3
salaries
| ₹3 L/yr - ₹3 L/yr |
Cognizant
WNS
Capita
Gallagher