Filter interviews by
Clear (1)
I applied via Company Website and was interviewed in Sep 2021. There were 4 interview rounds.
Top trending discussions
I applied via Monster and was interviewed before Mar 2020. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed in Dec 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Apr 2021. There were 3 interview rounds.
I applied via Company Website and was interviewed before Jul 2021. There were 2 interview rounds.
Data Structure related questions
I applied via Naukri.com and was interviewed in Sep 2021. There was 1 interview round.
Microservices is an architectural style where an application is composed of small, independent services that communicate with each other.
Microservices are independently deployable and scalable.
Each microservice performs a single business capability.
Communication between microservices is usually through APIs.
Microservices can be developed using different programming languages and technologies.
Examples of companies using...
Spring Boot is a framework that simplifies the development of Java applications by providing pre-configured settings and dependencies.
Spring Boot uses an embedded server to run applications
It provides auto-configuration for commonly used libraries
It uses annotations to minimize boilerplate code
It supports various data sources and messaging systems
It can be easily integrated with other Spring projects
Example: @SpringBoo...
Angular can be connected with Spring Boot using REST APIs.
Create REST APIs in Spring Boot to expose data
Use Angular's HttpClient to make HTTP requests to the APIs
Parse the response data in Angular and display it in the UI
Use CORS configuration in Spring Boot to allow cross-origin requests from Angular
I applied via Company Website and was interviewed in Oct 2021. There was 1 interview round.
I was interviewed before Mar 2021.
To check if a number is a power of 2, we can use bitwise operations.
A power of 2 has only one bit set to 1, so we can use the bitwise AND operator to check if the number is a power of 2.
If n is a power of 2, then n & (n-1) will be 0.
For example, 8 (1000 in binary) is a power of 2, and 8 & 7 (0111 in binary) is 0.
Sort a stack without using another data structure
Use recursion to pop the top element and insert it at the bottom of the remaining stack
Repeat until the stack is sorted in ascending order
Time complexity: O(n^2), space complexity: O(n) due to recursion
Check if array has continuous increasing and decreasing values
Loop through the array and check if each element is greater than the previous one
Once you find the maximum element, check if the remaining elements are in decreasing order
If yes, return true else false
Design a cricinfo (LLD)
Identify the entities: players, teams, matches, scorecards, tournaments, etc.
Define the relationships between entities
Create a database schema to store the data
Implement APIs to fetch and update data
Design a UI to display the information
Consider scalability and performance
Ensure data security and privacy
posted on 14 Jan 2025
I applied via Approached by Company and was interviewed in Dec 2024. There were 2 interview rounds.
posted on 20 Jun 2024
I applied via LinkedIn and was interviewed before Jun 2023. There was 1 interview round.
Senior Software Engineer
778
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
338
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
331
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
272
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Software Engineer
269
salaries
| ₹0 L/yr - ₹0 L/yr |
Hewlett Packard Enterprise
IBM
Cisco
NetApp