AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
ONPASSIVE Angular Developer Interview Questions and Answers
10 Interview questions
The latest version of TypeScript used in my project has several new features.
Optional Chaining and Nullish Coalescing
Improved performance with faster compilation times
Support for private fields and methods
Higher order type inference from generic constructors
Support for ECMAScript private fields
Improved support for tuples
Smaller bundle sizes with tree shaking
Observable is for handling multiple values over time, while Promise is for handling a single value.
Observable can emit multiple values over time, while Promise can only emit a single value.
Observable can be cancelled, while Promise cannot be cancelled.
Observable provides operators for transforming and combining data, while Promise does not have such operators.
Observable is lazy, meaning it won't start emitting val...
Routing is the process of navigating between different components or pages in an Angular application.
Routing is used to create single-page applications (SPAs) where the content is dynamically loaded without refreshing the entire page.
In Angular, routing is achieved using the RouterModule and the RouterLink directives.
The RouterModule is imported from the @angular/router package and added to the imports array of th...
Lazy loading is a technique in Angular that loads modules or components on-demand, improving performance.
Lazy loading helps reduce initial load time by loading modules or components only when needed
It improves performance by splitting the application into smaller chunks
Syntax: import() function is used to dynamically load modules or components
Angular has four types of data bindings: Interpolation, Property binding, Event binding, and Two-way binding.
Interpolation: {{ expression }}
Property binding: [property]="expression"
Event binding: (event)="expression"
Two-way binding: [(ngModel)]="expression"
Life cycle hooks are methods that get called at specific stages of a component's life cycle.
ngOnInit() - called after the component is initialized
ngOnChanges() - called when the component's input properties change
ngOnDestroy() - called just before the component is destroyed
Used to perform specific actions at different stages of a component's life cycle
Yes, I have worked on them in my project
The @Input() and @Output() are decorators in Angular used for communication between parent and child components.
The @Input() decorator is used to pass data from a parent component to a child component.
The @Output() decorator is used to emit events from a child component to a parent component.
The @Input() property is bound to a value in the parent component template using property binding.
The @Output() property is ...
To call REST APIs in Angular, use the HttpClient module and its methods like get(), post(), put(), delete().
Import the HttpClientModule in your Angular module
Inject the HttpClient service in your component or service
Use the HttpClient methods to make HTTP requests to the REST APIs
Handle the response using observables and subscribe to them
Example: httpClient.get('https://api.example.com/data')
Example: httpClient.po...
Web workers are JavaScript scripts that run in the background, separate from the main browser thread.
Web workers allow for parallel execution of tasks, improving performance and responsiveness.
They can perform computationally intensive tasks without blocking the user interface.
Web workers communicate with the main thread using message passing.
Examples of tasks suitable for web workers include data processing, imag...
Passing data between parent and child components is component interaction in Angular.
Use @Input decorator to pass data from parent to child component
Use @Output decorator and EventEmitter to pass data from child to parent component
Use services to share data between components
Use ViewChild to access child component's properties and methods from parent component
ONPASSIVE Angular Developer Interview Experiences
1 interview found
I applied via Naukri.com and was interviewed in Sep 2020. There were 3 interview rounds.
Interview Questionnaire
10 Questions
- Q1. What are life cycle hooks and have you worked on them in your project?
- Q2. How can you pass data between parent and child components?, what is component interaction
- Q3. What are different data bindings in angular
- Q4. What is lazy loading and write syntax
- Ans.
Lazy loading is a technique in Angular that loads modules or components on-demand, improving performance.
Lazy loading helps reduce initial load time by loading modules or components only when needed
It improves performance by splitting the application into smaller chunks
Syntax: import() function is used to dynamically load modules or components
- Q5. What are @Input() and @Output()?
- Ans.
The @Input() and @Output() are decorators in Angular used for communication between parent and child components.
The @Input() decorator is used to pass data from a parent component to a child component.
The @Output() decorator is used to emit events from a child component to a parent component.
The @Input() property is bound to a value in the parent component template using property binding.
The @Output() property is bound...
- Q6. What is routing and write its syntax
- Ans.
Routing is the process of navigating between different components or pages in an Angular application.
Routing is used to create single-page applications (SPAs) where the content is dynamically loaded without refreshing the entire page.
In Angular, routing is achieved using the RouterModule and the RouterLink directives.
The RouterModule is imported from the @angular/router package and added to the imports array of the app...
- Q7. What are web workers?
- Ans.
Web workers are JavaScript scripts that run in the background, separate from the main browser thread.
Web workers allow for parallel execution of tasks, improving performance and responsiveness.
They can perform computationally intensive tasks without blocking the user interface.
Web workers communicate with the main thread using message passing.
Examples of tasks suitable for web workers include data processing, image man...
- Q8. Difference between Observable and Promise?
- Ans.
Observable is for handling multiple values over time, while Promise is for handling a single value.
Observable can emit multiple values over time, while Promise can only emit a single value.
Observable can be cancelled, while Promise cannot be cancelled.
Observable provides operators for transforming and combining data, while Promise does not have such operators.
Observable is lazy, meaning it won't start emitting values u...
- Q9. What are the features of latest typescript version you used in your project
- Ans.
The latest version of TypeScript used in my project has several new features.
Optional Chaining and Nullish Coalescing
Improved performance with faster compilation times
Support for private fields and methods
Higher order type inference from generic constructors
Support for ECMAScript private fields
Improved support for tuples
Smaller bundle sizes with tree shaking
- Q10. How do you call REST APIs in angular?
- Ans.
To call REST APIs in Angular, use the HttpClient module and its methods like get(), post(), put(), delete().
Import the HttpClientModule in your Angular module
Inject the HttpClient service in your component or service
Use the HttpClient methods to make HTTP requests to the REST APIs
Handle the response using observables and subscribe to them
Example: httpClient.get('https://api.example.com/data')
Example: httpClient.post('h...
Interview Preparation Tips
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.
- Q1.
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
- 0 - representing an empty cell
- 1 - representing a fre...
- Ans.
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process
Track the time taken to rot all oranges and return -1 if any fresh oranges remain
Handle edge cases like no fresh oranges or all oranges already rotten
Consider using a queue to efficiently process adjacent oranges
- Q2.
Majority Element Problem Statement
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Exampl...
- Ans.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
- Q3.
Maximum Path Sum Between Two Leaves Problem Description
You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...
- Ans.
Find the maximum path sum between two leaf nodes in a binary tree.
Traverse the tree to find the maximum path sum between two leaf nodes.
Keep track of the maximum sum found so far.
Consider all possible paths between leaf nodes.
Handle cases where the tree has only a single leaf node.
Implement a recursive function to calculate the maximum path sum.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
- Q1.
N-th Node From The End Problem Statement
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
Example:
Input:
If the given list is (1 -> -2 -&g...
- Ans.
Find the N-th node from the end of a Singly Linked List of integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
- Q2.
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 or when one node is the LCA itself.
- Q3.
Reverse Words in a String: Problem Statement
You are given a string of length
N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o... - Ans.
Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.
Split the input string by spaces to get individual words
Reverse the list of words
Join the reversed words with a single space in between
Handle leading/trailing spaces by stripping them before and after reversing
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
- Q1.
Minimum Time To Solve The Problems
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
- Ans.
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
Sort subjects in descending order
Assign subjects to friends one by one until all subjects are assigned
The maximum workload will be the sum of problems assigned to the friend with the most problems
Return the maximum workload as the minimum time required
- Q2. What is grammar in the context of compiler design?
- Ans.
Grammar in compiler design defines the syntax and structure of a programming language.
Grammar specifies the rules for forming valid statements in a programming language.
It consists of a set of production rules that define how valid programs can be constructed.
There are different types of grammars such as context-free grammar, regular grammar, etc.
Example: In C programming language, the grammar specifies that a for loop...
- Q3. What is a token in compiler design?
- Ans.
A token in compiler design is a basic unit of syntax that the compiler can understand and process.
Tokens are the smallest units of a program that are meaningful to the compiler.
Examples of tokens include keywords, identifiers, operators, and punctuation symbols.
Tokens are generated by the lexical analysis phase of the compiler.
Tokens are used by the parser to build the abstract syntax tree of the program.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.
- Q1.
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.
Find 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 path sum to the total sum when reaching a leaf node
Use modulo (10^9 + 7) to handle large outputs
- Q2. What is a regular language?
- Ans.
A regular language is a language that can be recognized by a finite automaton.
Regular languages can be described by regular expressions.
Regular languages are closed under union, concatenation, and Kleene star operations.
Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.
- Q3. What are NP and NP-Hard problems?
- Ans.
NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.
NP problems can be verified in polynomial time but not necessarily solved in polynomial time.
NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.
Examples of NP problems include the subset sum problem and the traveling salesm...
Round duration - 30 minutes
Round difficulty - Easy
That was the round for which I’ve been waiting for hours
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.
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
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 24 Jan 2022
I applied via Campus Placement and was interviewed before Jan 2021. There were 3 interview rounds.
Interview Questionnaire
3 Questions
- Q1. 1. Write a code to split an array of integers into two subarray where both the array has equal sum.
- Ans.
Code to split an array of integers into two subarrays with equal sum.
Iterate through the array and calculate the total sum.
Divide the sum by 2 to get the target sum for each subarray.
Use dynamic programming to find a subset of the array that adds up to the target sum.
Return the two subarrays.
Example: [1, 2, 3, 4, 5, 6] -> [1, 2, 3, 6], [4, 5]
Example: [1, 2, 3, 4, 5] -> [1, 4, 5], [2, 3]
- Q2. To write code to build up a binary tree from scratch (implement a BST) and then to write all the methods like all the tree traversal algo, and all other stuffs.
- Ans.
Implementing a binary search tree and its traversal methods.
Start by defining a Node class with left and right child pointers.
Implement insert() method to add nodes to the tree.
Implement inorder(), preorder(), and postorder() traversal methods.
Implement search() method to find a node in the tree.
Implement delete() method to remove a node from the tree.
Consider edge cases like empty tree, duplicate nodes, etc.
- Q3. Other OOPs concept and questions related to DSA and OS.
Interview Preparation Tips
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. Java multithreading, oops
I applied via Campus Placement and was interviewed before Dec 2021. There were 4 interview rounds.
Thre are aptitude question with coding round
(1 Question)
- Q1. Introduction Basics of programming
(1 Question)
- Q1. HR questions introduced yourself family background
Interview Preparation Tips
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
It was very good
- Q1.
Find the Longest Palindromic Substring
Given a string ‘S’ composed of lowercase English letters, your task is to identify the longest palindromic substring within ‘S’.
If there are multiple longest palin...
- Ans.
Find the longest palindromic substring in a given string, returning the rightmost one if multiple exist.
Use dynamic programming to check if substrings are palindromes
Iterate through the string and expand around each character to find palindromic substrings
Keep track of the longest palindromic substring found
- Q2.
Minimum Sum in Matrix Problem Statement
You are given a 2D matrix 'ARR' of size 'N x 3' with integers, where 'N' is the number of rows. Your task is to compute the smallest sum achievable by selecting one...
- Ans.
Find the smallest sum achievable by selecting one element from each row of a 2D matrix, following certain constraints.
Iterate through each row and calculate the minimum sum by selecting elements that do not violate the constraints.
Keep track of the minimum sum achieved so far.
Avoid selecting elements directly beneath previously selected elements.
Example: For input [[1, 2, 3], [4, 8, 6], [1, 5, 3]], the optimal selectio...
Round duration - 1 hour
Round difficulty - Medium
It was a good interview
Interview Preparation Tips
Tip 1 : Daily practice programming
Tip 2 : Work with honesty
Tip 3 : Do with utmost dedication
Tip 1 : Write with honesty
Tip 2 : Mention about your achievements
Skills evaluated in this interview
amit kashyap
I applied via Naukri.com and was interviewed in Jun 2021. There were 3 interview rounds.
Interview Questionnaire
1 Question
- Q1. They asked me questions related to my project on which i had work in my last company. And there were questions from core java , database, collections, Spring framework ,
Interview Preparation Tips
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 27 Jul 2022
I applied via Campus Placement and was interviewed before Jul 2021. There were 5 interview rounds.
Round 1 was about 60 mins long. Basic Aptitude questions along with Programming MCQ
Round 2 had 2 coding questions with a time limit of 60mins. Intermediate level problem solving
knowledge is neccessary.
(1 Question)
- Q1. Technical Round 1 was 1hr long. Detailed Insights about my project and a few programming questions in DSA
(1 Question)
- Q1. This Technical Round 2 was 1hr long and was mainly focused on problem solving skills and a few basic programming concepts.
(1 Question)
- Q1. Three Situational questions were asked .
Interview Preparation Tips
- Data Structures
- Algorithms
- CPP
- Problem Solving
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 14 Sep 2021
I appeared for an interview in Apr 2021.
(1 Question)
Round duration - 90 minutes
Round difficulty - Hard
Timing was 10 AM. Platform was very lagging. So overall it was not a good experience.
- Q1.
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).
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 topological ordering of the graph as an array of integers.
Interview Preparation Tips
Tip 1 : Practice data structure
Tip 2 : Do some projects
Tip 1 : Keep it short
Tip 2 : Try not to add false information
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Bounteous x Accolite
Deepak Kumar
posted on 12 Jun 2021
I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.
Interview Questionnaire
2 Questions
- Q1. 1. If you given a no return its corresponding excel no.
- Ans.
Convert given no to corresponding excel no.
Excel no starts from 1 and goes up to 16384
Excel no is calculated using column and row numbers
For example, 1 corresponds to A, 27 corresponds to AA, 28 corresponds to AB, and so on
- Q2. 2. find unique character in a window of k size in a string
- Ans.
Find unique characters in a window of k size in a string.
Use a sliding window approach.
Maintain a hash table to keep track of character frequency.
Remove characters from hash table as the window slides.
Interview Preparation Tips
Skills evaluated in this interview
ONPASSIVE Interview FAQs
Some of the top questions asked at the ONPASSIVE Angular Developer interview -
Tell us how to improve this page.
ONPASSIVE Interviews By Designations
- ONPASSIVE Product Owner Interview Questions
- ONPASSIVE Data Scientist Interview Questions
- ONPASSIVE Software Engineer Interview Questions
- ONPASSIVE Software Developer Interview Questions
- ONPASSIVE IT Executive Interview Questions
- ONPASSIVE Senior Software Engineer Interview Questions
- ONPASSIVE Web Developer Interview Questions
- ONPASSIVE Marketing 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
Interview Questions from Similar Companies
ONPASSIVE Angular Developer Reviews and Ratings
based on 3 reviews
Rating in categories
|
Software Engineer
143
salaries
|  ₹3.8 L/yr - ₹13.3 L/yr |
|
Senior Software Engineer
69
salaries
| ₹6 L/yr - ₹18 L/yr |
|
Business Analyst
47
salaries
| ₹3 L/yr - ₹9.5 L/yr |
|
Java Developer
40
salaries
| ₹3 L/yr - ₹8 L/yr |
|
Technical Support Engineer
40
salaries
| ₹2.4 L/yr - ₹6 L/yr |
ITC Infotech
CMS IT Services
KocharTech
3i Infotech
- Home >
- Interviews >
- ONPASSIVE Interview Questions
