AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Webuters Technologies Software Engineer Interview Questions and Answers
Webuters Technologies Software Engineer Interview Experiences
2 interviews found
(1 Question)
- Q1. Related to my tech- stack
Assessment round to evaluate my coding skills.
(1 Question)
- Q1. How do you respond to feedback indicating that your code does not meet the expected quality standards, and what specific steps will you take to improve?
- Ans.
I acknowledge the feedback, analyze the issues, seek guidance if needed, and implement necessary improvements.
Acknowledge the feedback without getting defensive
Analyze the specific issues pointed out
Seek guidance from team members or mentors if needed
Implement necessary improvements based on feedback
Selected
I appeared for an interview before Feb 2024.
(1 Question)
- Q1. Can you explain your current project?
- Ans.
I am currently working on developing a web-based application for managing inventory and sales for a retail company.
Utilizing React for front-end development
Implementing Node.js for back-end functionality
Integrating MongoDB for database management
(1 Question)
- Q1. Do you have a higher proficiency in frontend or backend development, and how many projects have you completed using Node.js?
- Ans.
I have a higher proficiency in backend development and have completed 5 projects using Node.js.
Higher proficiency in backend development
Completed 5 projects using Node.js
(1 Question)
- Q1. How would you manage the transition if the company decided to switch to a new programming language or framework?
- Ans.
I would approach the transition by conducting thorough research, training team members, and gradually implementing the new language or framework.
Conduct research to understand the benefits and challenges of the new language or framework
Provide training sessions for team members to learn the new technology
Start by implementing the new language or framework in small, low-risk projects before transitioning fully
Collaborat...
Top trending discussions
Interview questions from similar companies
Interview Preparation Tips
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5
- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.
College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]
Software Developer Interview Questions & Answers
JPMorgan Chase & Co.
Anonymous
posted on 10 May 2015
Interview Questionnaire
11 Questions
- Q1. What is the difference between multi tasking, multi processing and multi programming operating systems with examples ?
- Ans.
Multi tasking, multi processing, and multi programming are different approaches to managing tasks in an operating system.
Multi tasking allows multiple tasks to run concurrently on a single processor.
Multi processing involves multiple processors running tasks simultaneously.
Multi programming allows multiple programs to be loaded into memory and executed concurrently.
Examples of multi tasking operating systems include Wi...
- Q2. Tell me about memory allocation (stack vs. heap)?
- Ans.
Memory allocation refers to the process of assigning memory to programs during runtime.
Stack allocation is done automatically and is limited in size.
Heap allocation is done manually and is larger in size.
Stack memory is used for local variables and function calls.
Heap memory is used for dynamic memory allocation.
Memory leaks can occur if heap memory is not properly managed.
- Q3. You have two threads one printing even numbers in order and other odd numbers. Design an algorithm so that it prints numbers in natural order?
- Ans.
Use a shared variable and synchronization mechanisms to ensure natural order printing of numbers.
Create two threads, one for printing even numbers and the other for printing odd numbers.
Use a shared variable to keep track of the current number to be printed.
Implement synchronization mechanisms like locks or semaphores to ensure only one thread can access the shared variable at a time.
Each thread should check if it is i...
- Q4. Print a matrix in spiral order?
- Ans.
Printing a matrix in spiral order
Start from the first element and print it
Move in a spiral order towards the center of the matrix
Repeat until all elements are printed
- Q5. Thread class and Runnable Interface?
- Ans.
Thread class and Runnable Interface are used for multithreading in Java.
Thread class is a predefined class in Java that provides methods to create and control threads.
Runnable interface is used to define a task that can be executed by a thread.
Thread class implements Runnable interface.
Thread class provides more control over threads than Runnable interface.
Example: Thread t = new Thread(new MyRunnable()); t.start();
Exa...
- Q6. What’s the difference between a Linked List and an ArrayList and give me an example of when to use which?
- Ans.
Linked List is a dynamic data structure while ArrayList is a static data structure.
Linked List is best for frequent insertion and deletion operations.
ArrayList is best for frequent access operations.
Linked List uses more memory than ArrayList.
ArrayList is faster than Linked List for accessing elements.
Use Linked List when you need to frequently add or remove elements from the list.
Use ArrayList when you need to frequen
- Q7. Questions of OS concepts?
- Q8. A role play scenario was given. With a clear instruction on I don’t need to know the basis and the hypothetical assumption was presented. I was told that I was expected to respond to the given scenario, in...
- Q9. Why are you interested in a career in investment banking?
- Ans.
I am not interested in a career in investment banking.
I am more interested in a career in software development
I enjoy problem-solving and creating innovative solutions through coding
Investment banking does not align with my passion and skill set
- Q10. Why have you chosen to apply to J.P. Morgan?
- Ans.
I have chosen to apply to J.P. Morgan because of their reputation, global presence, and opportunities for growth.
J.P. Morgan has a strong reputation in the financial industry.
They have a global presence with offices in multiple countries.
The company offers various opportunities for career growth and development.
J.P. Morgan is known for its innovative technology solutions in the financial sector.
I am impressed by their ...
- Q11. Have you ever made a mistake? Tell us about it?
- Ans.
Yes, I have made a mistake in my previous project.
I underestimated the complexity of a task and ended up missing the deadline.
I failed to properly test a feature, resulting in a bug that affected user experience.
I accidentally deleted an important file without having a backup.
I misunderstood a requirement and implemented a feature incorrectly.
Interview Preparation Tips
Total Questions: 1
General Tips: Interview Process: Aptitude test, followed by 3 rounds of interview. Interview process was very good. Just be positive to clear the interview.
Check this link before appearing for interview with JP Morgan. It will help -----
Skills: Algorithm, Data structure, Stack
College Name: Na
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
It was in the day time. I was asked the programming language of my choice. It was mostly focused on programming fundamentals. I was asked 2 questions based on Data Structures and Algorithms.
- Q1. How can you detect a loop in a linked list?
- Ans.
A loop in a linked list can be detected using Floyd's Cycle Detection Algorithm.
Use two pointers - slow and fast, where slow moves one step at a time and fast moves two steps at a time.
If there is a loop, the two pointers will eventually meet at some point within the loop.
To detect the start of the loop, reset one pointer to the head and move both pointers one step at a time until they meet again.
Round duration - 30 minutes
Round difficulty - Easy
This round was mostly focused on my resume and projects.
Round duration - 30 minutes
Round difficulty - Easy
It was in the evening. I went to their office in Gurgaon. It was taken by one of the technology director who had a lot of experience.
Interview Preparation Tips
Do practice a lot of data structures questions as mostly questions in interviews are based on them. Also, do prepare for projects mentioned in your resume and skills which you have mentioned. Coding ninjas has a big hand in making my interview clear as I have taken a course from the coding Ninjas which helped me a lot to make my concepts clear.
Application resume tips for other job seekersKeep it short and crisp. Go through it properly before the interview. Make sure that you haven't put anything in it that can cause you problems during the interview.
Final outcome of the interviewSelectedSkills evaluated in this interview
I applied via Referral and was interviewed before Sep 2019. There were 3 interview rounds.
Interview Questionnaire
8 Questions
- Q1. Java logical question
- Q2. Webdriver architecture
- Q3. Framework, file and folder structure
- Q4. Your approach to tackle dynamic objects
- Ans.
I approach dynamic objects by analyzing their behavior and adapting my approach accordingly.
I start by understanding the nature of the dynamic object and its expected behavior
I then analyze its movement patterns and any potential obstacles or hazards
Based on this analysis, I adapt my approach to ensure safe and efficient interaction with the dynamic object
For example, when working with a moving conveyor belt, I would e...
- Q5. Implicit and explicit wait in selenium
- Ans.
Implicit and explicit wait are two types of wait in Selenium used to synchronize the test execution with the application.
Implicit wait is used to set a default waiting time for the web elements to load before throwing an exception.
Explicit wait is used to wait for a specific condition to occur before proceeding with the test execution.
Implicit wait is set globally for the entire test script while explicit wait is set f...
- Q6. Java oops concepts
- Q7. Sql queries related to joins
- Q8. Basic Unix commands
Interview Preparation Tips
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. It was wonderful .They have asked about normal technical questions with how we faced real time.Both SAS and Mainfrmae.
I applied via Approached by Company and was interviewed before Aug 2021. There were 3 interview rounds.
(1 Question)
- Q1. Rpgle, SqlRpgle questions
(1 Question)
- Q1. Sql and debugging related questions
(1 Question)
- Q1. Asked about previous job experience and expectations from current job
Interview Preparation Tips
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 90 minutes
Round difficulty - Medium
There were 33 questions in total. The objective questions were simple.
- Q1.
Sort Big List Dates Problem Statement
Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.
Example:
Inpu...
- Ans.
Sort a list of event dates in ascending order based on year, month, and day.
Sort the list of dates based on year, then month, and finally day.
Use a sorting algorithm to rearrange the dates in ascending order.
Ensure the constraints are met for each date in the list.
- Q2.
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
... - Ans.
Given an array and a target sum, find all pairs of elements that add up to the target sum.
Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the pairs based on the first element and then the second element.
Handle edge cases like duplicate elements and pairs with the same values.
Example...
- Q3.
Maximum Sum Problem Statement
Given an integer
N, your task is to recursively break it into three integer parts:N / 2,N / 3, andN / 4. You need to compute the maximum sum possible by dividing the numbe... - Ans.
Given an integer N, recursively break it into three parts and find the maximum sum possible.
Recursively divide N into N/2, N/3, and N/4 to find the maximum sum
Compare the sum obtained by dividing N with the sum of N itself
Return the maximum sum for each test case
Interview Preparation Tips
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
Skills evaluated in this interview
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions based on DSA.
- Q1.
Duplicate Integer in Array
Given an array
ARRof sizeN, containing each number between 1 andN-1at least once, identify the single integer that appears twice.Input:
The first line contains an integer... - Ans.
Identify the duplicate integer in an array containing numbers between 1 and N-1.
Iterate through the array and keep track of the frequency of each element using a hashmap.
Return the element with a frequency greater than 1 as the duplicate integer.
Ensure the constraints are met and a duplicate number is guaranteed to be present.
- Q2.
Sum Root to Leaf Numbers
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
- Ans.
Calculate the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current node value to the path sum and multiply by 10 for each level
When reaching a leaf node, add the final path sum to the total sum
Return the total sum modulo (10^9 + 7)
- Q3.
Topological Sort Problem Statement
You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.
Explanation:
A directed acyclic g...
- Ans.
Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.
Create a graph data structure to represent the DAG
Use depth-first search (DFS) to perform topological sorting
Maintain a visited array to keep track of visited nodes
Return the ordering of nodes after DFS traversal
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round with questions based on DSA.
- Q1.
LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes,
XandY. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes... - Ans.
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other.
Consider edge cases like when X or Y is the root node.
Implement a recursive or iterative solution to find the LCA efficiently.
- Q2.
Rotated Array Minimum Finder
You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...
- Ans.
Implement a function to find the minimum number in a rotated sorted array efficiently.
Use binary search to find the minimum element in the rotated array.
Compare the mid element with the start and end elements to determine which half of the array to search next.
Continue the binary search until the minimum element is found.
- Q3.
Maximum Binary Tree Construction Problem
Given an array
TREEof 'N' unique integers, construct a maximum binary tree using the following rules:- The root of this tree is the maximum number in
TREE. - T...
- The root of this tree is the maximum number in
- Ans.
Construct a maximum binary tree from an array of unique integers following specific rules.
Find the maximum number in the array to set as the root of the tree.
Recursively construct the left subtree with elements before the maximum number.
Recursively construct the right subtree with elements after the maximum number.
Interview Preparation Tips
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.
Skills evaluated in this interview
Webuters Technologies Interview FAQs
Some of the top questions asked at the Webuters Technologies Software Engineer interview -
Tell us how to improve this page.
Interview Questions for Popular Designations
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Intern Interview Questions
- Software Developer Interview Questions
- Software Development Engineer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Webuters Technologies Software Engineer Interview Process
based on 2 interviews
Interview experience
Software Engineer Interview Questions from Similar Companies
Webuters Technologies Software Engineer Reviews and Ratings
based on 3 reviews
Rating in categories
|
Software Engineer
16
salaries
|  ₹2.4 L/yr - ₹9 L/yr |
|
Salesforce Developer
7
salaries
| ₹1 L/yr - ₹6 L/yr |
|
Senior Software Engineer
7
salaries
| ₹5.4 L/yr - ₹17 L/yr |
|
Software Developer
5
salaries
| ₹1 L/yr - ₹3.7 L/yr |
|
Business Analyst
5
salaries
| ₹5.2 L/yr - ₹14.4 L/yr |
JPMorgan Chase & Co.
Wells Fargo
Citicorp
Bajaj Finserv
- Home >
- Interviews >
- Webuters Technologies Interview Questions >
- Webuters Technologies Software Engineer Interview Questions
