Premium Employer

i

This company page is being actively managed by Backbase Team. If you also belong to the team, you can get access from here

Backbase Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Backbase Angular Frontend Developer Interview Questions and Answers

Updated 5 Sep 2024

Backbase Angular Frontend Developer Interview Experiences

2 interviews found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Recruitment Consulltant and was interviewed in Jun 2024. There were 2 interview rounds.

Round 1 - Coding Test 

3 Angular coding question was there. 1.5 hour Machine test.

Round 2 - Technical 

(3 Questions)

  • Q1. Pass by Value, pass by reference
  • Q2. What is !! Operator
  • Ans. 

    The !! operator is used to convert a value to a boolean type by negating it twice.

    • The !! operator is used to convert a value to a boolean type.

    • It first negates the value, then negates it again to return a boolean.

    • Example: !!'hello' will return true, as a non-empty string is truthy.

  • Answered by AI
  • Q3. How to handle multiple API if they are inter related each other in Angular?
  • Ans. 

    Use Angular services to manage multiple APIs, create separate services for each API, and handle interdependencies using observables and RxJS operators.

    • Create separate Angular services for each API to encapsulate API calls and logic.

    • Use observables and RxJS operators to handle asynchronous data flow and manage interdependencies between APIs.

    • Implement error handling and retry mechanisms to ensure robustness when dealing ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be strong in basics of Javascript

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

60 min coding round based on angular

Round 2 - Technical 

(1 Question)

  • Q1. State mangement

Angular Frontend Developer Interview Questions Asked at Other Companies

asked in Nihilent
Q1. How to implement interfaces without methods?
asked in TCS
Q2. 1. How to share data from one component to another ?
asked in Infosys
Q3. What is lazy loading and how can we achieve this?
Q4. Qus 1: What is template from and reactive Form and what is differ ... read more
Q5. How to id or data pass by routing and go to the another page?

Interview questions from similar companies

Interview Questionnaire 

9 Questions

  • Q1. Questions related to the work done at my previous company
  • Q2. Find if a given directed graph is cyclic or not
  • Ans. 

    To check if a directed graph is cyclic or not

    • Use Depth First Search (DFS) algorithm to traverse the graph

    • Maintain a visited set to keep track of visited nodes

    • Maintain a recursion stack to keep track of nodes in the current DFS traversal

    • If a node is visited and is already in the recursion stack, then the graph is cyclic

    • If DFS traversal completes without finding a cycle, then the graph is acyclic

  • Answered by AI
  • Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
  • Ans. 

    Return a random byte from a stream of bytes with equal probability.

    • Create a variable to store the count of bytes read

    • Create a variable to store the current random byte

    • For each byte read, generate a random number between 0 and the count of bytes read

    • If the random number is 0, store the current byte as the random byte

    • Return the random byte

  • Answered by AI
  • Q4. Find if a given Binary Tree is BST or not
  • Ans. 

    Check if a binary tree is a binary search tree or not.

    • Traverse the tree in-order and check if the values are in ascending order.

    • For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.

    • Use recursion to check if all nodes in the tree satisfy the above condition.

  • Answered by AI
  • Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
  • Ans. 

    Algorithm to find Nth-to-Last element in a singly linked list of unknown length

    • Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning

    • Move both pointers simultaneously until the second pointer reaches the end of the list

    • The first pointer will be pointing to the Nth-to-Last element

    • If N=0, return the last element

    • Parse the list only once

  • Answered by AI
  • Q6. Given an array of integers, print all possible permutations. Also explain your approach
  • Ans. 

    Print all possible permutations of an array of integers

    • Use recursion to swap elements and generate permutations

    • Start with the first element and swap it with each subsequent element

    • Repeat the process for the remaining elements

    • Stop when all elements have been swapped with the first element

    • Print each permutation as it is generated

  • Answered by AI
  • Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
  • Ans. 

    Design a stack that prints the minimum element pushed in O(1)

    • Use two stacks, one for storing elements and another for storing minimums

    • When pushing an element, compare it with the top of minimum stack and push the smaller one

    • When popping an element, pop from both stacks

    • To get the minimum element, just return the top of minimum stack

  • Answered by AI
  • Q8. Given a linked list with loop, how would you find the starting point of the loop ?
  • Ans. 

    To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.

    • Use two pointers, one moving at twice the speed of the other.

    • When they meet, move one pointer to the head of the list and keep the other at the meeting point.

    • Move both pointers one step at a time until they meet again, which is the starting point of the loop.

  • Answered by AI
  • Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
  • Ans. 

    To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.

    • Use binary search to find the number in each row and column

    • Start from the top-right corner or bottom-left corner to optimize search

    • Time complexity: O(m log n) or O(n log m) depending on the starting corner

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: Na

Skills evaluated in this interview

I appeared for an interview before Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The second round is also written but you need to write programming based on their concept.

  • Q1. 

    Prime Numbers Identification

    Given a positive integer N, your task is to identify all prime numbers less than or equal to N.

    Explanation:

    A prime number is a natural number greater than 1 that has no po...

  • Ans. 

    Identify all prime numbers less than or equal to a given positive integer N.

    • Iterate from 2 to N and check if each number is prime

    • Use the Sieve of Eratosthenes algorithm for better efficiency

    • Optimize by only checking up to the square root of N for divisors

  • Answered by AI
  • Q2. 

    Palindrome String Validation

    Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.

    Note:
    The string 'S' should be evaluated in a case...
  • Ans. 

    Check if a given string is a palindrome after removing special characters, spaces, and converting to lowercase.

    • Remove special characters and spaces from the string

    • Convert the string to lowercase

    • Check if the modified string is a palindrome by comparing characters from start and end

  • Answered by AI
Round 2 - Face to Face 

(6 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions mainly on Java and OOPS concepts.

  • Q1. What is the difference between static methods and instance methods in Java?
  • Ans. 

    Static methods belong to the class itself, while instance methods belong to individual objects of the class.

    • Static methods are called using the class name, while instance methods are called using object references.

    • Static methods cannot access instance variables directly, while instance methods can access both static and instance variables.

    • Static methods are shared among all instances of the class, while instance method...

  • Answered by AI
  • Q2. What is the difference between an abstract class and an interface in Java?
  • Ans. 

    Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.

    • Abstract class can have constructors, member variables, and methods with implementation.

    • Interface can only have abstract methods and constants.

    • A class can implement multiple interfaces but can only extend one abstract class.

    • Example: Abstract class - Animal with abstract method 'eat', Interface - Flyable with m

  • Answered by AI
  • Q3. What is the difference between ClassNotFoundException and NoClassDefFoundError in Java?
  • Ans. 

    ClassNotFoundException occurs when a class is not found during runtime, while NoClassDefFoundError occurs when a class was found during compilation but not during runtime.

    • ClassNotFoundException is a checked exception, while NoClassDefFoundError is an Error.

    • ClassNotFoundException occurs when a class is not found at runtime, usually due to a missing classpath or incorrect class name.

    • NoClassDefFoundError occurs when a cla...

  • Answered by AI
  • Q4. What is the difference between an Error and an Exception in Java?
  • Ans. 

    Error is a serious issue that cannot be handled at runtime, while Exception is a recoverable issue that can be caught and handled.

    • Error is a subclass of Throwable and is usually caused by the environment or system, such as running out of memory or stack overflow.

    • Exception is also a subclass of Throwable but is caused by the application code, such as invalid input or file not found.

    • Errors are unchecked and are not meant...

  • Answered by AI
  • Q5. What is SerialVersionUID in Java?
  • Ans. 

    SerialVersionUID is a unique identifier used by Java to ensure the compatibility of serialized objects.

    • SerialVersionUID is a static final long variable in a class that implements Serializable interface.

    • It is used to ensure that the serialized object can be deserialized correctly even if the class definition has changed.

    • If the SerialVersionUID of the serialized object does not match the one in the class, an InvalidClass...

  • Answered by AI
  • Q6. What are the requirements for creating an immutable class in Java?
  • Ans. 

    Requirements for creating an immutable class in Java

    • Make the class final so it cannot be extended

    • Make all fields private and final

    • Do not provide setter methods, only getter methods

    • Ensure that mutable objects are not returned in getter methods

    • Override equals() and hashCode() methods for proper comparison

    • Consider making defensive copies of mutable fields in constructor or getter methods

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAYodlee interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Copy constructor implementation it was based on
Round 2 - Technical 

(1 Question)

  • Q1. Binary search question on array
Round 3 - HR 

(1 Question)

  • Q1. Experience and expectations on salary
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Apr 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Platform - Mettl
3 Questions of medium level difficulty to do in 2 hours, typically contain concepts like DSA, DP etc.

Round 3 - Technical 

(3 Questions)

  • Q1. What is structure padding?
  • Ans. 

    Structure padding is the insertion of unused bytes between structure members to align them on memory boundaries.

    • Padding is added to ensure that each member of a structure starts at a memory address that is a multiple of its size.

    • Padding is compiler-dependent and can vary between different platforms and architectures.

    • Padding can affect the size of a structure and the performance of the program.

    • Example: struct example { ...

  • Answered by AI
  • Q2. College Project discussion
  • Q3. Form a dictionary from name.
  • Ans. 

    Forming a dictionary from name

    • Create an empty dictionary

    • Iterate through each character in the name

    • Add the character as a key and its frequency as value in the dictionary

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(1 Question)

  • Q1. Tell me about yourself, availability, visa-related questions
Round 2 - Coding Test 

Dynamic programming questions, longg time to complete the 2 questions

Round 3 - Group Discussion 

Problem solving : a clock with 3 hands, no numbers written, guess what it is

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

1 hour 3 questions easy to medium leetcode.

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Oct 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Coding Test 

There will be 3 coding questions, Easy, moderate and hard level.

Round 3 - Technical 

(1 Question)

  • Q1. 2nd round will be technical round, they will ask mostly theoretical coding questions(Mostly array, Linked List), puzzles (Geeks Puzzles are enough).

Interview Preparation Tips

Topics to prepare for SOTI Software Developer interview:
  • Array
  • Linked List
  • Data Structures
  • Microsoft Sql
Interview experience
2
Poor
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
No response

I applied via Campus Placement and was interviewed in Jul 2024. There was 1 interview round.

Round 1 - Coding Test 

3 hours was the duration of the test. 3 questions were asked

Interview Preparation Tips

Topics to prepare for SOTI Software Developer interview:
  • DSA
Interview preparation tips for other job seekers - You can clear the OA round if you have a good grasp on DSA.

Backbase Interview FAQs

How many rounds are there in Backbase Angular Frontend Developer interview?
Backbase interview process usually has 2 rounds. The most common rounds in the Backbase interview process are Coding Test and Technical.
What are the top questions asked in Backbase Angular Frontend Developer interview?

Some of the top questions asked at the Backbase Angular Frontend Developer interview -

  1. How to handle multiple API if they are inter related each other in Angul...read more
  2. What is !! Opera...read more
  3. Pass by Value, pass by refere...read more

Tell us how to improve this page.

Backbase Angular Frontend Developer Interview Process

based on 2 interviews

Interview experience

4
  
Good
View more
Join Backbase Re-architect banking around your customer

Interview Questions from Similar Companies

Mobileum Interview Questions
3.3
 • 37 Interviews
SOTI Interview Questions
3.3
 • 23 Interviews
Bentley Systems Interview Questions
4.3
 • 21 Interviews
FinThrive Interview Questions
3.7
 • 20 Interviews
3Pillar Global Interview Questions
3.3
 • 19 Interviews
Mentor Graphics Interview Questions
4.0
 • 18 Interviews
Yodlee Interview Questions
3.8
 • 17 Interviews
View all

Backbase Angular Frontend Developer Reviews and Ratings

based on 1 review

4.0/5

Rating in categories

4.0

Skill development

4.0

Work-life balance

4.0

Salary

4.0

Job security

4.0

Company culture

4.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Senior Backend Engineer
21 salaries
unlock blur

₹28 L/yr - ₹33 L/yr

Back End Engineer
20 salaries
unlock blur

₹12 L/yr - ₹21 L/yr

Senior Software Engineer
16 salaries
unlock blur

₹28 L/yr - ₹34 L/yr

Front end Engineer
15 salaries
unlock blur

₹14 L/yr - ₹22.4 L/yr

QA Engineer
11 salaries
unlock blur

₹15.1 L/yr - ₹21 L/yr

Explore more salaries
Compare Backbase with

Duck Creek Technologies

4.4
Compare

FinThrive

3.7
Compare

Mobileum

3.3
Compare

AgreeYa Solutions

3.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview