Filter interviews by
I applied via LinkedIn and was interviewed in Nov 2022. There were 3 interview rounds.
The Two-Sum Problem solve using any programming language(like C#, Python, JavaScrpit ...)
Angular Interceptor is a middleware that intercepts HTTP requests and responses.
It can be used to add headers, modify requests, handle errors, and more.
Interceptors can be global or specific to a certain request.
Example use cases include adding authentication tokens to requests or logging responses.
Interceptors are implemented using the HttpInterceptor interface in Angular.
Microservice C# is a software architecture pattern where an application is built as a collection of small, independent services.
Each service is responsible for a specific task or feature
Services communicate with each other through APIs
Allows for scalability, flexibility, and easier maintenance
Examples include Netflix, Amazon, and Uber
I am a senior software developer with over 10 years of experience in developing and implementing software solutions.
I have expertise in multiple programming languages including Java, Python, and C++.
I have experience in developing web applications using frameworks such as Spring and Django.
I have worked on projects involving database design and management using SQL and NoSQL databases.
I have experience in leading devel...
Top trending discussions
posted on 28 Aug 2024
I applied via Recruitment Consulltant and was interviewed before Aug 2023. There was 1 interview round.
Share the link for codesignal
The question is asking for the current time and the angles formed by the hour and minute hands on a clock.
The angle between the hour and minute hands of a clock can be calculated using the formula: angle = |(30*hour - (11/2)*minutes)|
At 3:00, the angle between the hour and minute hands is 90 degrees.
At 6:00, the angle between the hour and minute hands is 180 degrees.
At 9:00, the angle between the hour and minute hands
I applied via Referral and was interviewed before Nov 2023. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
There was a coding round and out of 75 students 28 got selected for next round
HashMap is a data structure that stores key-value pairs and provides constant time complexity for basic operations.
HashMap allows quick access to values based on their keys
Keys must be unique and values can be duplicated
HashMap is not thread-safe and requires synchronization for concurrent access
Java's HashMap implementation uses hashing to distribute keys across buckets
I applied via Approached by Company and was interviewed in Jul 2024. There were 3 interview rounds.
I have a strong technical background, proven track record of delivering high-quality software, and a passion for continuous learning and improvement.
I have a Bachelor's degree in Computer Science and X years of experience in software development.
I have successfully led multiple projects from conception to completion, delivering high-quality software on time and within budget.
I am proficient in a variety of programming ...
I was interviewed before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide true
if such a subset exists, otherwise r...
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently
Create a 2D array to store if a subset with a particular sum exists
Iterate through the array and update the 2D array accordingly
Check if the value at the end of the iteration is true for the given K
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Use a queue to keep track of visited nodes and their neighbors.
Ensure to print the traversal sequence in the correct order.
Handle disconnected components by checking for unvisited nodes.
Follow the BFS approach of exploring neighbors before moving to the next level.
Round duration - 60 minutes
Round difficulty - Easy
I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.
Given a string STR
consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".
The first line contains an integ...
Replace spaces in a string with '@40'.
Iterate through each character in the string
Replace spaces with '@40'
Return the modified string
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.
based on 1 interview
Interview experience
Senior Software Engineer
84
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
56
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Engineer
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Manager
21
salaries
| ₹0 L/yr - ₹0 L/yr |
CIBIL
Credit Information Bureau
Equifax
Crif High Mark Credit Information Services