Filter interviews by
Asked two questions.
1. Related to string manipulation.
2. Subarray problem.
Top trending discussions
posted on 26 Oct 2020
I applied via Naukri.com and was interviewed in Sep 2020. There were 4 interview rounds.
Data scraping, computer vision, agile methodologies, change request, and testing methods are all important aspects of software engineering.
Data scraping involves extracting data from websites or other sources.
Computer vision involves using algorithms to interpret and analyze visual data.
Agile methodologies are a set of principles for software development that prioritize flexibility and collaboration.
Change requests are...
posted on 16 May 2021
I applied via Recruitment Consultant and was interviewed in Nov 2020. There were 4 interview rounds.
posted on 28 Apr 2021
I applied via Naukri.com and was interviewed in Mar 2021. There were 4 interview rounds.
posted on 30 Nov 2021
I applied via Recruitment Consultant and was interviewed before Nov 2020. There were 3 interview rounds.
Find sum of squares of numbers in list using stream API.
Use mapToInt() to convert list of integers to IntStream
Use map() to square each element of IntStream
Use sum() to get the sum of squares
Searching in 2D sorted array row wise and column wise.
Start from the top right corner or bottom left corner
Compare the target with the current element
Move left or down if target is smaller or move right or up if target is larger
Repeat until target is found or out of bounds
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 1 hour
Round difficulty - Medium
You are provided with an integer array ARR
of length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T...
Find the smallest positive integer missing from an array of integers.
Iterate through the array and mark positive integers as visited by changing the sign of the corresponding index.
After marking all positive integers, iterate again to find the first positive integer with a positive value.
Return the index of the first positive integer found plus one as the answer.
Tip 1 : During an interview, never say that you don't know the answer, keep trying and the interviewer will help you himself.
Tip 2 : Keep speaking up the approach going on in your mind, they want to judge your approaches much more than whether the answer is right or wrong.
Tip 3 : Be confident, cheerful, keep smiling, and continue making eye contact with the interviewer, this leaves a positive impression.
Tip 4 : Search and practice questions specific to the company, questions are repeated several times.
Tip 5 : A sound knowledge of Microsoft Azure Services and cloud computing will be an icing on the cake, and increase your chances to get selected.
Tip 6 : Keep giving contests on coding platforms, it will help you to stay motivated and check your stand.
Tip 7 : Keep a daily goal of number of questions instead of the time duration.
Tip 1 : Everything mentioned on the resume should be thoroughly known to you since if they catch you being dishonest, pretty good coding skills also might not help.
Tip 2 : Have projects related to the same field you are trying to apply for mentioned in your resume, this shows you are already experienced in the field.
Tip 3 : Adding references of some experienced people of the same field might help you gain their trust.
Tip 4 : Do not keep your resume too long, and do not mention irrelevant details, keep it short and crisp.
Tip 5 : Some experience in the field of operations and management or some positions of responsibility will really help you score extra points since it shows you have leadership qualities and are familiar with the market along with super coding skills.
posted on 8 Apr 2021
posted on 5 Dec 2021
I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.
Use Dijkstra's algorithm to find the shortest path between 2 vertices in a graph.
Implement Dijkstra's algorithm to find the shortest path
Create a priority queue to keep track of the vertices with the shortest distance
Use a visited set to avoid revisiting vertices
Stop when the destination vertex is reached
Return the shortest path found
Example: finding the shortest path between A and D in a graph with weighted edges: A->...
Find pairs in an array with sum equal to 0.
Use a hash table to store the frequency of each element.
Iterate through the array and for each element, check if its complement (negative value) exists in the hash table.
If it exists, add the frequency of the complement to the count of pairs.
Return the count of pairs.
Example: array = [2, -2, 3, 0, -3], pairs = 2 (-2, 2 and -3, 3)
posted on 19 May 2022
I appeared for an interview before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.
The binary tree is represented i...
Print nodes of a binary tree in spiral order traversal.
Use a queue to perform level order traversal of the binary tree.
Alternate between printing nodes from left to right and right to left at each level.
Handle null nodes represented by '-1' appropriately.
Example: For input '1 2 3 -1 -1 4 5 -1 -1 -1 -1', the output should be '1 3 2 4 5'.
Round duration - 60 Minutes
Round difficulty - Easy
You are given a list of N
strings called A
. Your task is to determine whether you can form a given target string by combining one or more strings from A
.
The strings from A
c...
Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.
Iterate through all possible combinations of strings from the list to form the target string.
Use recursion to try different combinations of strings.
Check if the current combination forms the target string.
Return true if a valid combination is found, otherwise return false.
Round duration - 60 Minutes
Round difficulty - Easy
Design an elevator system for efficient vertical transportation.
Divide building into zones to optimize elevator usage.
Implement algorithms for efficient elevator scheduling.
Include safety features like emergency stop buttons and overload sensors.
Consider user interface for passengers to select floors and monitor elevator status.
Tip 1 : Never give up
Tip 2 : Practice
Tip 3 : Be positive
Tip 1 : Keep it short
Tip 2 : Highlight skills and achievements
based on 1 interview
Interview experience
Technical Support Engineer
907
salaries
| ₹8.5 L/yr - ₹25 L/yr |
Technical Consultant
343
salaries
| ₹13.8 L/yr - ₹32 L/yr |
Member Technical Staff
284
salaries
| ₹18.8 L/yr - ₹60 L/yr |
Senior Member of Technical Staff
256
salaries
| ₹30 L/yr - ₹95 L/yr |
Senior Technical Consultant
249
salaries
| ₹18 L/yr - ₹45.1 L/yr |
SAP
Zoho
Oracle
Adobe