Filter interviews by
I applied via Naukri.com and was interviewed in Mar 2022. There were 5 interview rounds.
Check if the string is palindrome or not.Easy to do using a stack data type
Data Annotations are attributes used in .NET Framework to provide metadata about data elements.
Data Annotations are used to validate data in models.
They can be used to specify data types, display names, and format strings.
Examples include [Required], [StringLength], and [RegularExpression].
Solid Principles are a set of five design principles for writing maintainable and scalable software.
Single Responsibility Principle (SRP)
Open/Closed Principle (OCP)
Liskov Substitution Principle (LSP)
Interface Segregation Principle (ISP)
Dependency Inversion Principle (DIP)
To tune a Stored Procedure, identify bottlenecks, optimize queries, and use indexes.
Identify slow queries and optimize them
Use indexes to improve query performance
Avoid using cursors and temporary tables
Minimize network traffic by reducing data returned
Use SET NOCOUNT ON to reduce network traffic
Use stored procedure parameters instead of constants or variables
Use TRY/CATCH blocks to handle errors
Monitor performance usi...
Routing in MVC is the process of mapping URLs to controller actions.
Routing determines which controller and action should handle a request.
Routes are defined in the RouteConfig.cs file.
Routes can include parameters that are passed to the controller action.
Routes can also include constraints to limit which requests match the route.
Example: /products/5 maps to the ProductsController's Details action with id parameter 5.
Effective communication and collaboration are key to managing work with US-based employees across time zones.
Utilize collaboration tools like Slack and Zoom for real-time communication.
Schedule regular check-ins to align on project goals and progress.
Be mindful of time zone differences when planning meetings; use tools like World Time Buddy.
Encourage asynchronous communication to accommodate different working hours, su...
I break down the problem into smaller parts and research each part to find a solution.
Identify the problem and its requirements
Break down the problem into smaller parts
Research each part to find a solution
Try different approaches and test them
Collaborate with colleagues or seek help from online communities
I expect a competitive salary based on my skills, experience, and industry standards, ideally in the range of $X to $Y.
Research industry standards: For example, Glassdoor or Payscale can provide insights into typical salaries for similar roles.
Consider my experience: With over 5 years in software development, I bring valuable skills that justify a higher salary.
Location matters: Salaries can vary significantly based on...
Top trending discussions
I applied via Instahyre and was interviewed in Nov 2023. There were 4 interview rounds.
Cpding questions along with pther quantitative and qualitative questions
Discussion with manager about background and other details.
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
I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.
Implementing 'tail -f' allows real-time monitoring of file changes, displaying new lines as they are added.
Use file handling in Python to open a file in read mode.
Utilize a loop to continuously read new lines from the file.
Implement a sleep function to avoid busy waiting and reduce CPU usage.
Example: Use 'with open(filename) as f:' to manage file context.
Use 'f.seek(0, 2)' to move to the end of the file before reading ...
I applied via Referral and was interviewed in Feb 2024. There were 3 interview rounds.
Implement tail -f command
Browserstack is a popular cloud-based cross-browser testing tool used by developers worldwide.
Provides access to a wide range of browsers and devices for testing
Allows for parallel testing to save time and increase efficiency
Integrates with popular testing frameworks like Selenium and Appium
Offers features like screenshots, video recordings, and debugging tools
Used by companies like Microsoft, Twitter, and Airbnb for t...
Yes, I faced a challenge in integrating a new third-party API with our existing system.
Had to understand the documentation of the API thoroughly
Encountered compatibility issues with our system
Worked closely with the API provider to troubleshoot and resolve issues
I applied via Recruitment Consulltant and was interviewed before May 2023. There were 4 interview rounds.
Coding was hard conducted on the platform called interview.io
Consits of 2 q 1 is Dp, and the other is Graph
Bit harder compared to other companies
Reasoning like questions
It was an easy online test
Question relates to graph like minimum spanning tree,hashing questiond
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
On hacker rank , included subjects like DBMS , OS and coding questions on priority queue
I applied via Campus Placement
Aptitude questions with 2-3 coding questions
Interpreter executes code line by line, compiler translates code into machine code before execution.
Interpreter translates code into machine code line by line during runtime
Compiler translates code into machine code before execution
Interpreted languages include Python, JavaScript
Compiled languages include C, C++
based on 3 interview experiences
based on 4 reviews
Rating in categories
Software Engineer III
46
salaries
| ₹9.8 L/yr - ₹22.2 L/yr |
Software Engineer
40
salaries
| ₹6.7 L/yr - ₹29.3 L/yr |
Software Engineer2
36
salaries
| ₹7.5 L/yr - ₹13.5 L/yr |
Technical Project Manager
29
salaries
| ₹11.9 L/yr - ₹31 L/yr |
Business Analyst
23
salaries
| ₹5.5 L/yr - ₹15 L/yr |
Yodlee
Fingent
Bravura Solutions
CloudMoyo