AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Bajaj
Finserv
Compare
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Bajaj Finserv Angular Developer Interview Questions and Answers
6 Interview questions
switchMap is an operator in RxJS that projects each source value to an Observable which is merged in the output Observable.
switchMap is used to switch to a new Observable whenever the source Observable emits a new value.
It cancels the previous Observable subscription when a new value is emitted.
Example: source$.pipe(switchMap(value => new Observable(value)))
RxJS is a library for reactive programming using Observables to handle asynchronous data streams.
RxJS stands for Reactive Extensions for JavaScript.
It allows you to work with asynchronous data streams and events.
Operators like map, filter, mergeMap, switchMap, etc., can be used to manipulate and combine streams.
Example: Using RxJS to handle HTTP requests in Angular applications.
?? is the nullish coalescing operator, while ? is the optional chaining operator in Angular.
?? is used to provide a default value when a variable is null or undefined.
? is used to safely access nested properties of an object without causing errors if a property is null or undefined.
Multicasting is the process of sending data from one source to multiple destinations simultaneously.
In multicasting, a single sender sends data to a group of receivers at the same time.
It is commonly used in streaming services where one server sends data to multiple clients.
Multicasting is more efficient than unicasting (one-to-one communication) when sending data to multiple recipients.
What people are saying about Bajaj Finserv
Lazy loading is a technique used in web development to defer loading non-essential resources until they are needed.
Lazy loading helps improve page load times by only loading necessary resources initially.
It is commonly used in Angular applications to load modules, components, or routes on demand.
Lazy loading can be implemented using Angular's loadChildren property in the routing configuration.
API to send data to a specific endpoint using any language
Choose a programming language that supports HTTP requests
Create a function to send data to the endpoint using HTTP POST method
Include necessary headers and parameters in the request
Handle any errors or exceptions that may occur
Bajaj Finserv Angular Developer Interview Experiences
2 interviews found
Selected
I applied via Naukri.com and was interviewed in Sep 2024. There was 1 interview round.
(8 Questions)
- Q1. Scenario based questions
- Q2. What is lazy loading?
- Ans.
Lazy loading is a technique used in web development to defer loading non-essential resources until they are needed.
Lazy loading helps improve page load times by only loading necessary resources initially.
It is commonly used in Angular applications to load modules, components, or routes on demand.
Lazy loading can be implemented using Angular's loadChildren property in the routing configuration.
- Q3. What is switchMap?
- Ans.
switchMap is an operator in RxJS that projects each source value to an Observable which is merged in the output Observable.
switchMap is used to switch to a new Observable whenever the source Observable emits a new value.
It cancels the previous Observable subscription when a new value is emitted.
Example: source$.pipe(switchMap(value => new Observable(value)))
- Q4. Observables and promises
- Q5. Difference between ?? and ?:
- Ans.
?? is the nullish coalescing operator, while ? is the optional chaining operator in Angular.
?? is used to provide a default value when a variable is null or undefined.
? is used to safely access nested properties of an object without causing errors if a property is null or undefined.
- Q6. What is services, modules, decorators, directive?
- Ans.
Services, modules, decorators, and directives are key concepts in Angular development.
Services: Reusable code that can be injected into components to provide specific functionality.
Modules: Containers for different parts of an Angular application, including components, services, and directives.
Decorators: Functions that modify classes or properties in Angular, used for adding metadata or behavior to components.
Directiv...
- Q7. What is multicasting ?
- Ans.
Multicasting is the process of sending data from one source to multiple destinations simultaneously.
In multicasting, a single sender sends data to a group of receivers at the same time.
It is commonly used in streaming services where one server sends data to multiple clients.
Multicasting is more efficient than unicasting (one-to-one communication) when sending data to multiple recipients.
- Q8. What is RxJS ?
- Ans.
RxJS is a library for reactive programming using Observables to handle asynchronous data streams.
RxJS stands for Reactive Extensions for JavaScript.
It allows you to work with asynchronous data streams and events.
Operators like map, filter, mergeMap, switchMap, etc., can be used to manipulate and combine streams.
Example: Using RxJS to handle HTTP requests in Angular applications.
Skills evaluated in this interview
(1 Question)
- Q1. Write an API to send data to particular end point using any langauge
- Ans.
API to send data to a specific endpoint using any language
Choose a programming language that supports HTTP requests
Create a function to send data to the endpoint using HTTP POST method
Include necessary headers and parameters in the request
Handle any errors or exceptions that may occur
(1 Question)
- Q1. OOPS concepts, real time coding questions , Questions on web development
(1 Question)
- Q1. About internships and projects
Interview Preparation Tips
Interview questions from similar companies
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.
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
This round was mostly focused on my resume and projects.
- Q1. Tell me about your 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
Software Developer Interview Questions & Answers
State Street Corporation
Anonymous
posted on 20 May 2017
I appeared for an interview in May 2017.
Interview Questionnaire
6 Questions
- Q1. Can string class be extended
- Ans.
Yes, the string class can be extended in most programming languages.
Inheritance can be used to extend the functionality of the string class.
By creating a new class that inherits from the string class, additional methods and properties can be added.
Extending the string class allows for customization and adding specific functionality to strings.
Example: In Python, the string class can be extended by creating a new class ...
- Q2. What are the implecit object in JSP
- Ans.
Implicit objects in JSP are predefined objects that are available for use without any declaration or initialization.
Implicit objects in JSP include request, response, session, application, out, config, pageContext, page, exception, and others.
These objects provide access to various aspects of the JSP environment and can be used to perform common tasks.
For example, the request object allows access to HTTP request parame...
- Q3. How does hash map works
- Ans.
A hash map is a data structure that uses a hash function to map keys to values.
Hash map stores key-value pairs
It uses a hash function to compute an index for each key
Collisions can occur when two keys hash to the same index
Hash maps provide fast access to values based on their keys
- Q4. Difference between string buffer and string builder
- Ans.
StringBuffer and StringBuilder are both used to manipulate strings, but StringBuffer is thread-safe while StringBuilder is not.
StringBuffer is synchronized, making it safe for use in multi-threaded environments.
StringBuilder is not synchronized, making it faster but not thread-safe.
StringBuffer is preferred when multiple threads are involved, while StringBuilder is preferred for single-threaded scenarios.
Both classes p...
- Q5. What is MVC
- Ans.
MVC is a software architectural pattern that separates an application into three main components: Model, View, and Controller.
Model represents the data and business logic of the application.
View is responsible for displaying the user interface.
Controller handles user input, updates the model, and interacts with the view.
MVC promotes separation of concerns and modularity in software development.
Example: In a web applica...
- Q6. What are the annotation used in RESTFULL web services
- Ans.
Annotations used in RESTful web services
1. @Path - Specifies the URI path for the resource
2. @GET - Specifies that the method handles HTTP GET requests
3. @POST - Specifies that the method handles HTTP POST requests
4. @PUT - Specifies that the method handles HTTP PUT requests
5. @DELETE - Specifies that the method handles HTTP DELETE requests
6. @PathParam - Binds the value of a URI template parameter to a method paramete...
Interview Preparation Tips
Skills evaluated in this interview
What people are saying about Bajaj Finserv
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 ]
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
Rachit Mundhra
Interview Preparation Tips
Experience: The test was for two and half hours where 1 hour was for general aptitude, 1 hr was for coding aptitude(either on java or C or C++as you choose) and 1/2 an hour for two coding questions.
Round: Technical Interview
Experience: In technical round they asked puzzles, aptitude questions and basic C coding. I was asked to write the code for two questions(one was on sort and search) and was asked the logic of two questions.They asked basics of linked lists, stacks, queues. Infact they were not very interested in the syntax and were pressing on the logic
General Tips: Being a non software branch students is not at all a problem. The company took 4 interns where 3 were from core branches. The fact that we had to work in JAVA and most of us didn't know JAVA, the company only looks for aptitude and ability to learn. So if you don't know anything, tell frankly that you don't know that part, rather than guessing. Be thorough with what you know and confidentially answer all the questions.
Also do not be tensed and take things lightly, if the interviewer is joking. Be candid.
Skill Tips: Learn basics of coding from books . Aptitude can be done from sites likes geeks for geeks, etc. The level of aptitude is not very high and infact the coding aptitude is also theoretical and does not involve in depth knowledge.
Skills:
College Name: NIT Surathkal
Interview Preparation Tips
Experience: Online Test (General aptitude, C aptitude ,Programming problems).
General Tips: Study basics of C and DSA well. Utilize the last summer vacations for studying for placements. Be confident and Honest.
Yes it is challenging and exhausting. It tests your patience. But final reward is also great so we must keep going toward it.
Skill Tips: Online coding sites such as Codechef, etc. Narasimha Karumanchi for data structures and algorithm will help in preparation.
Skills:
College Name: NIT Surathkal
Aqel Ahammad
I applied via Campus Placement
Interview Questionnaire
2 Questions
- Q1. How can a chemical Engineer help citi?
- Ans.
A chemical engineer can help Citi by providing expertise in process optimization, risk management, and sustainability.
Optimizing Citi's manufacturing processes to reduce costs and increase efficiency
Developing risk management strategies to ensure compliance with environmental regulations
Implementing sustainable practices to reduce Citi's environmental impact
Providing technical expertise in chemical reactions and materi...
- Q2. He asked me about my JEE Rank, preparations
Interview Preparation Tips
Experience: I had done many web and android apps. They asked me about my institute experience, things I have done here. It was an easy walk for me.
Skills: SQL, Java Programming
Duration: 2
College Name: IIT Madras
Bajaj Finserv Interview FAQs
Tell us how to improve this page.
Bajaj Finserv Interviews By Designations
- Bajaj Finserv Sales Officer Interview Questions
- Bajaj Finserv Assistant Manager Interview Questions
- Bajaj Finserv Sales Manager Interview Questions
- Bajaj Finserv Sales Executive Interview Questions
- Bajaj Finserv Collections Manager Interview Questions
- Bajaj Finserv Assistant Sales Manager Interview Questions
- Bajaj Finserv Area Sales Manager Interview Questions
- Bajaj Finserv Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Front end Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Junior Software Developer Interview Questions
- Developer Interview Questions
- UI Developer Interview Questions
- Angular Frontend Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 1 interview experience
Difficulty level
Duration
Interview Questions from Similar Companies
Bajaj Finserv Angular Developer Reviews and Ratings
based on 1 review
Rating in categories
|
Sales Officer
1.3k
salaries
|  ₹1.5 L/yr - ₹4.2 L/yr |
|
Assistant Manager
1.3k
salaries
| ₹2.2 L/yr - ₹6.6 L/yr |
|
Sales Executive
1.2k
salaries
| ₹1.5 L/yr - ₹4.5 L/yr |
|
Sales Manager
1.1k
salaries
| ₹3.5 L/yr - ₹7.8 L/yr |
|
Manager
939
salaries
| ₹4.5 L/yr - ₹10 L/yr |
Wells Fargo
JPMorgan Chase & Co.
HSBC Group
Cholamandalam Investment & Finance
- Home >
- Interviews >
- Bajaj Finserv Interview Questions
