Filter interviews by
I applied via Referral and was interviewed in May 2019. There were 4 interview rounds.
Top trending discussions
I applied via Referral and was interviewed in Jan 2020. There were 4 interview rounds.
Design an MVC controller system to route URLs to the appropriate controllers based on the URL structure.
Define a routing mechanism that maps URLs to controller actions.
Use a hierarchical structure where each segment of the URL corresponds to a controller.
Example: For 'xyz.com/a/b/c', 'a' routes to 'AController', 'b' to 'BController', and 'c' to 'CController'.
Implement a method to parse the URL and invoke the correspond...
Autocomplete in IDEs helps developers write code faster by suggesting code snippets and completing code as they type.
Autocomplete should suggest code snippets based on the context of the code being written
Autocomplete should prioritize suggestions based on frequency of use
Autocomplete should also suggest variable and function names
Autocomplete should be customizable to allow for user-defined snippets and suggestions
Exa...
My weakness is public speaking.
I tend to get nervous when speaking in front of large groups.
I am working on improving my public speaking skills by practicing and seeking feedback.
I have taken courses and attended workshops to help me overcome my fear of public speaking.
Comparing 2 basketball game scenarios with different number of trials and baskets required to win
Calculate the probability of winning in each game scenario using binomial distribution formula
Compare the probabilities to determine which game scenario is preferable
In game1, the probability of winning is p. In game2, the probability of winning is the sum of probabilities of making 2 or 3 baskets
If p is high, game1 is pref...
I want to join Visa to contribute to innovative payment solutions and be part of a global leader in financial technology.
Visa is at the forefront of digital payment innovation, allowing me to work on cutting-edge technologies.
The company's commitment to security aligns with my passion for developing secure software solutions.
Visa's global presence offers opportunities to collaborate with diverse teams and learn from di...
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Print the given Binary search tree in ascending order
Traverse the left subtree recursively
Print the root node
Traverse the right subtree recursively
Chennai faces problems related to water scarcity, traffic congestion, and pollution.
Water scarcity due to inadequate rainfall and poor management of water resources.
Traffic congestion due to the increasing number of vehicles and poor road infrastructure.
Pollution caused by industries, vehicular emissions, and improper waste disposal.
Need more context on the question to provide an answer.
Please provide more information on the problem to be solved.
Without context, it is difficult to provide a solution.
Can you please provide more details on the problem statement?
I appeared for an interview before Apr 2021.
Round duration - 45 minutes
Round difficulty - Easy
This was a technical interview round.
Round duration - 40 minutes
Round difficulty - Easy
This was the second technical interview round.
Immutability in Java refers to the property of objects whose state cannot be changed once they are created.
Immutability ensures that once an object is created, its state cannot be modified.
Immutable objects are thread-safe and can be shared without the risk of data corruption.
String class in Java is an example of an immutable class.
To create an immutable class, make the class final, all fields private, and provide only...
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview before Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions on DSA.
You are given an array of integers PRICES
where PRICES[i]
represents the price of a stock on the i-th day, and an integer K
representing the number of transactions you...
Determine maximum profit with at most K transactions by buying and selling stocks on given days.
Iterate through the array of prices while keeping track of the maximum profit achievable with at most K transactions.
Use dynamic programming to store the maximum profit at each day and transaction count.
Consider buying and selling stocks at each day to calculate the maximum profit.
Return the maximum profit achievable with at...
Given a Binary Tree consisting of 'N' nodes with integer values, your task is to determine the in-order traversal of the Binary Tree.
The first line contains ...
The task is to determine the in-order traversal of a Binary Tree given in level order.
Implement a function to perform in-order traversal of a Binary Tree
Use recursion to traverse left subtree, visit root, and then traverse right subtree
Handle null nodes denoted by -1 in the input
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
In 5 years, I see myself as a senior software engineer leading a team of developers on innovative projects.
Continuing to enhance my technical skills and knowledge through ongoing learning and certifications
Taking on more leadership responsibilities and mentoring junior team members
Contributing to the development of cutting-edge software solutions
Building strong relationships with colleagues and stakeholders to drive pr...
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Detecting loop in a linked list
Use two pointers, one moving one node at a time and the other moving two nodes at a time
If there is a loop, the two pointers will eventually meet
If any of the pointers reach the end of the list, there is no loop
DFS (Depth-First Search) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
DFS uses a stack to keep track of visited nodes and explore adjacent nodes.
It can be implemented recursively or iteratively.
DFS is useful for solving problems like finding connected components, detecting cycles, and solving mazes.
To find a cycle in a graph, use depth-first search (DFS) and keep track of visited nodes.
Implement DFS algorithm to traverse the graph
Maintain a visited array to keep track of visited nodes
If a visited node is encountered again during DFS, a cycle exists
Hashing is a process of converting data into a fixed-size numerical value called a hash code.
Hashing is used to quickly retrieve data from large datasets.
It is commonly used in data structures like hash tables and hash maps.
Hash functions should be fast, deterministic, and produce unique hash codes for different inputs.
Examples of hash functions include MD5, SHA-1, and SHA-256.
The question asks for the number of pairs between 1 and N that satisfy a specific mathematical relation.
The relation is pow(a,3) + pow(b,3) = pow(c,3) + pow(d,3)
The values of a, b, c, and d should be less than or equal to N
Count the number of pairs that satisfy the relation
Merge sort is a divide-and-conquer algorithm that recursively divides an array into two halves, sorts them, and then merges them.
Divide the array into two halves
Recursively sort each half
Merge the sorted halves back together
Repeat until the entire array is sorted
I recently learned about the benefits of using Docker for containerization.
Docker allows for easy packaging and deployment of applications
It helps in creating consistent environments across different platforms
Docker containers are lightweight and efficient
Example: I used Docker to containerize a microservices architecture for a recent project
Software Developer
5
salaries
| ₹5 L/yr - ₹17 L/yr |
Software Engineer
4
salaries
| ₹9.5 L/yr - ₹23 L/yr |
Test Engineer
4
salaries
| ₹2 L/yr - ₹6.3 L/yr |
Senior Test Engineer
4
salaries
| ₹10 L/yr - ₹16.3 L/yr |
Senior Software Developer
4
salaries
| ₹9.4 L/yr - ₹12 L/yr |
FIS
Broadridge Financial Solutions
PayPal
MasterCard