Filter interviews by
Clear (1)
I applied via Campus Placement
3 Coding Questions of moderate level .
Very easy online coding round
Email classifier using ML
Use supervised learning algorithms like Naive Bayes or Support Vector Machines
Preprocess email data by tokenizing, removing stop words, and stemming
Split data into training and testing sets for model evaluation
Evaluate model performance using metrics like accuracy, precision, recall, and F1 score
The different scopes of a bean in software development.
Singleton: A single instance of the bean is created and shared across the application.
Prototype: A new instance of the bean is created every time it is requested.
Request: A new instance of the bean is created for each HTTP request.
Session: A new instance of the bean is created for each user session.
Global session: A new instance of the bean is created for each glob
Top trending discussions
2 easy level dsa ques
I applied via Referral and was interviewed before Aug 2023. There were 2 interview rounds.
It consist of 3 questions on hackerrank
I applied via Campus Placement and was interviewed in Oct 2024. There was 1 interview round.
1 easy question based on string and core subjects amd project related questions
I applied via Walk-in and was interviewed before Oct 2020. There were 3 interview rounds.
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 3 interviews
Interview experience
Senior Software Engineer
694
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
258
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
236
salaries
| ₹0 L/yr - ₹0 L/yr |
Consultant
183
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Software Engineer
146
salaries
| ₹0 L/yr - ₹0 L/yr |
PayPal
Visa
American Express
Discover Financial Services