Filter interviews by
Clear (1)
I applied via Approached by Company and was interviewed in Feb 2022. There were 2 interview rounds.
30 mintues, relationship topics
I applied via Company Website and was interviewed in Feb 2022. There were 2 interview rounds.
I applied via Company Website and was interviewed in Feb 2022. There were 2 interview rounds.
I am open to discussing salary based on the responsibilities and opportunities offered by the position.
I am flexible and open to negotiation.
I am more interested in the overall package and growth opportunities than just the salary.
I would like to be compensated fairly based on my skills, experience, and the market value for the position.
I am confident that we can come to a mutually beneficial agreement.
My family background is diverse and has influenced my values and work ethic.
My parents come from different cultural backgrounds, which has exposed me to different perspectives and traditions.
My father is an engineer and my mother is a teacher, which has instilled in me a passion for both problem-solving and education.
I have a sibling who is also in the software development field, which has provided me with a supportive...
I have a strong technical background and a passion for software development.
I have a deep understanding of programming languages and frameworks.
I have experience in developing and delivering high-quality software solutions.
I am a quick learner and adapt easily to new technologies and methodologies.
I am a team player and can effectively collaborate with cross-functional teams.
I have excellent problem-solving and analyti...
My strengths include problem-solving, attention to detail, and teamwork. My weaknesses include time management and public speaking.
Strengths: problem-solving, attention to detail, teamwork
Weaknesses: time management, public speaking
I am a software developer with experience in developing web applications using various programming languages and frameworks.
Proficient in Java, Python, and JavaScript
Experience with front-end development using HTML, CSS, and React
Familiar with Agile development methodologies
Strong problem-solving and analytical skills
Worked on a team to develop a customer relationship management system for a large e-commerce company
Top trending discussions
posted on 11 May 2018
The program return in round1 is achieved using logic based on the round function.
The round1 program uses a specific logic to determine the return value.
The logic may involve mathematical calculations, conditional statements, or other operations.
The result is achieved by following the steps defined in the round1 logic.
Examples of round1 logic could include rounding a number to the nearest integer, performing a specific
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
posted on 2 Sep 2017
I was interviewed before Oct 2016.
Print a matrix in spiral order using clean and efficient code
Create four variables to keep track of the boundaries of the matrix
Use a while loop to iterate through the matrix in a spiral order
Print each element as you iterate through the matrix
Update the boundaries of the matrix after each iteration
Faculty Associate
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Soft Skills Trainer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Tata Trusts
Reliance Foundation India
HCL Foundation
Bharti Foundation