Upload Button Icon Add office photos
Engaged Employer

i

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

Bread Financial Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Bread Financial Software Engineer Interview Questions and Answers

Updated 16 Jul 2024

Bread Financial Software Engineer Interview Experiences

1 interview found

Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Tell me about one project you worked on?
  • Q2. Tell me about yourself?

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

It was held in the evening around 4 pm. The camera was on during the test to invigilate the activity of students. On any doubtful action, warning was given. Platform was easy to code in.

  • Q1. 

    Replace 0s Problem Statement

    You are given a matrix where every element is either a 1 or a 0. The task is to replace 0 with 1 if it is surrounded by 1s. A 0 (or a set of 0s) is considered to be surrounded...

  • Ans. 

    Given a matrix of 1s and 0s, replace 0s surrounded by 1s with 1s.

    • Iterate through the matrix and check each 0 surrounded by 1s.

    • If a 0 is surrounded by 1s, replace it with 1.

    • Update the matrix in place without printing or returning it.

  • Answered by AI
  • Q2. 

    Ways To Make Coin Change

    Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...

  • Ans. 

    The task is to determine the total number of ways to make change for a specified value using given denominations.

    • Use dynamic programming to keep track of the number of ways to make change for each value up to the target value.

    • Iterate through each denomination and update the number of ways to make change for each value based on the current denomination.

    • Handle base cases such as making change for 0 or using only the smal...

  • Answered by AI
  • Q3. 

    Minimum Subset Sum Difference Problem

    Given an array of non-negative integers, your task is to partition this array into two subsets such that the absolute difference between the sums of the subsets is mi...

  • Ans. 

    Given an array, partition it into two subsets to minimize the absolute difference between their sums.

    • Use dynamic programming to calculate all possible subset sums.

    • Iterate through the subset sums to find the minimum absolute difference.

    • Consider all possible partitions of the array elements.

    • Example: For input [1, 6, 11, 5], the minimum absolute difference is 1.

    • Example: For input [1, 2, 3], the minimum absolute difference

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

It was held in the morning around 11:30 am. The interview was scheduled on google meet. The interviewer was quite friendly. He started by a brief introduction. This round was mostly based on Data structures and algorithms. At the end he asked some concepts of OOPs and Operating System.

  • Q1. 

    String Transformation Problem

    Given a string (STR) of length N, you are tasked to create a new string through the following method:

    Select the smallest character from the first K characters of STR, remov...

  • Ans. 

    Given a string and an integer K, create a new string by selecting the smallest character from the first K characters of the input string and repeating the process until the input string is empty.

    • Iterate through the input string, selecting the smallest character from the first K characters each time.

    • Remove the selected character from the input string and append it to the new string.

    • Continue this process until the input ...

  • Answered by AI
  • Q2. 

    SpecialStack Design Problem

    Design a stack that efficiently supports the getMin() operation in O(1) time with O(1) extra space. This stack should include the following operations: push(), pop(), top(), is...

  • Ans. 

    Design a stack that supports getMin() operation in O(1) time with O(1) extra space using inbuilt stack data structure.

    • Use two stacks - one to store the actual data and another to store the minimum value at each level.

    • When pushing a new element, check if it is smaller than the current minimum and update the minimum stack accordingly.

    • When popping an element, also pop the top element from the minimum stack if it matches t...

  • Answered by AI
  • Q3. 

    Geometric Progression Subsequences Problem Statement

    Given an array of ‘N’ integers, determine the number of subsequences of length 3 that form a geometric progression with a specified common ratio ‘R’.

    ...

  • Ans. 

    Count the number of subsequences of length 3 forming a geometric progression with a specified common ratio in an array of integers.

    • Iterate through the array and for each element, check for possible subsequences of length 3 with the given common ratio.

    • Use a hashmap to store the count of possible subsequences for each element as the middle element.

    • Return the total count of subsequences modulo 10^9 + 7.

    • Example: For input ...

  • Answered by AI
  • Q4. What are the conditions for a deadlock to occur?
  • Ans. 

    Deadlock occurs when two or more processes are waiting for each other to release resources, resulting in a standstill.

    • Two or more processes must be holding resources and waiting for resources held by other processes

    • Processes cannot proceed because they are stuck in a circular wait

    • Resources cannot be forcibly released by the operating system

    • Examples: Process A holds Resource 1 and waits for Resource 2, while Process B h

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

It was held in the afternoon around 3pm. The interviewer was quite friendly. She started with my introduction. She asked 2-3 problems related to data structures and then asked about python libraries which I used in my projects.

  • Q1. 

    Group Anagrams Problem Statement

    Given an array or list of strings called inputStr, your task is to return the strings grouped as anagrams. Each group should contain strings that are anagrams of one anoth...

  • Ans. 

    Group anagrams in an array of strings based on their characters.

    • Iterate through each string in the input array/list.

    • For each string, sort the characters alphabetically to create a key for grouping.

    • Use a hashmap to group strings with the same key.

    • Return the grouped anagrams as separate arrays of strings.

  • Answered by AI
  • Q2. 

    Kth Smallest Element Problem Statement

    You are provided with an array of integers ARR of size N and an integer K. Your task is to find and return the K-th smallest value present in the array. All elements...

  • Ans. 

    Find the K-th smallest element in a given array of distinct integers.

    • Sort the array in ascending order.

    • Return the element at index K-1 from the sorted array.

    • Handle edge cases like K being out of bounds or array being empty.

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

It was held in the evening around 6 pm. The interviewer started with a brief introduction of me. He asked about my projects and then asked some concepts of Operating System and problems related to data structures. I had projects of Machine Learning and Deep learning. Discussion about projects continued for about 25 minutes.

  • Q1. 

    Middle of a Linked List

    You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.

    If there is an odd number of elements, return the ...

  • Ans. 

    Return the middle element of a singly linked list, or the one farther from the head node if there are even elements.

    • Traverse the linked list with two pointers, one moving twice as fast as the other

    • When the fast pointer reaches the end, the slow pointer will be at the middle

    • Return the element pointed to by the slow pointer

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Dr. B.R. Ambedkar National Institute of Technology. I applied for the job as Software Engineer in NoidaEligibility criteriaAbove 7 cgpaPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, OOPS, C programming, C++ Programming, Machine Learning, Operating System, Deep learning.Time required to prepare for the interview - 10 monthsInterview preparation tips for other job seekers

Tip 1 : Practice problems related to data structures and algorithms 
Tip 2 : Brush up fundamental concepts deeply
Tip 3 : You should have a deep knowledge of your projects and related technology.

Application resume tips for other job seekers

Tip 1 : It should not be more than a page.
Tip 2 : It should be precise and university projects or prior experience like industrial training or internship should be mentioned.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Referral and was interviewed before May 2021. There were 3 interview rounds.

Round 1 - Coding Test 

I dont remember exact questions but they are like leetcode easy and medium

Round 2 - One-on-one 

(2 Questions)

  • Q1. How web/internet works?
  • Ans. 

    The web/internet is a network of interconnected devices that communicate through standardized protocols to share information.

    • Devices connect to the internet through ISPs

    • Data is transmitted through packets using TCP/IP protocols

    • Web browsers use HTTP/HTTPS protocols to request and receive web pages

    • DNS servers translate domain names to IP addresses

    • Web servers host web pages and respond to requests

    • Search engines use web cr

  • Answered by AI
  • Q2. Coding questions with complete explanation
Round 3 - One-on-one 

(1 Question)

  • Q1. Coding and managerial round similar to round 2

Interview Preparation Tips

Interview preparation tips for other job seekers - practice coding well and some development skill. you are good to go

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. What is solid principles
  • Ans. 

    SOLID principles are a set of five design principles for writing maintainable and scalable code.

    • S - Single Responsibility Principle

    • O - Open/Closed Principle

    • L - Liskov Substitution Principle

    • I - Interface Segregation Principle

    • D - Dependency Inversion Principle

  • Answered by AI
  • Q2. What are internal working of has set
  • Ans. 

    HashSet is a collection that stores unique elements by using a hash table.

    • Elements are stored based on their hash code

    • Uses hashCode() and equals() methods to check for duplicates

    • Does not maintain insertion order

    • Allows null values

    • Example: HashSet set = new HashSet<>(); set.add("apple"); set.add("banana");

Answered by AI

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Jun 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Normal coding question medium level , approach focusing rounds actually how you get up to result

Interview Preparation Tips

Interview preparation tips for other job seekers - "GfG must do" should be solved properly alteast , otherwise go keep on practicing on any platform .

I applied via Company Website

Interview Questionnaire 

2 Questions

  • Q1. Question related to security
  • Q2. Question related to Data Structure

Interview Preparation Tips

Interview preparation tips for other job seekers - Should study about various data encryption algorithms. About spring security. Data structure

Software Engineer Interview Questions & Answers

Visa user image Pranali Yawalkar

posted on 14 Dec 2015

Interview Questionnaire 

7 Questions

  • Q1. Discussion on my internships and course projects.
  • Q2. My field of interest, how well have I fared in it.
  • Q3. Design a mvc controller system where given a url, I am able to invoke the right controller. Eg, given "xyz.com/a/b/c", I should be able to invoke c controller by going through a and b
  • Q4. Design autocomplete in IDEs
  • Ans. 

    Autocomplete in IDEs helps developers write code faster by suggesting code snippets and completing code as they type.

    • Autocomplete should suggest code snippets based on the context of the code being written

    • Autocomplete should prioritize suggestions based on frequency of use

    • Autocomplete should also suggest variable and function names

    • Autocomplete should be customizable to allow for user-defined snippets and suggestions

    • Exa...

  • Answered by AI
  • Q5. What is my weakness
  • Ans. 

    My weakness is public speaking.

    • I tend to get nervous when speaking in front of large groups.

    • I am working on improving my public speaking skills by practicing and seeking feedback.

    • I have taken courses and attended workshops to help me overcome my fear of public speaking.

  • Answered by AI
  • Q6. Given 2 game scenarios for basketball, and given p as the probability of making a basket in an attempt, I have to understand the condition where game1 would be preferable over game2. In first game, I have ...
  • Ans. 

    Comparing 2 basketball game scenarios with different number of trials and baskets required to win

    • Calculate the probability of winning in each game scenario using binomial distribution formula

    • Compare the probabilities to determine which game scenario is preferable

    • In game1, the probability of winning is p. In game2, the probability of winning is the sum of probabilities of making 2 or 3 baskets

    • If p is high, game1 is pref...

  • Answered by AI
  • Q7. Given a dictionary of words, I have to go from one word to another in least number of transitions where a transition is a defined as changing any letter of the current word such that the new word is also i...

Interview Preparation Tips

Round: Test
Experience: The test was on hackerrank.
Tips: * Fast coding and problem solving required
* Time crunch
* The test is valued a LOT in the hiring process
Duration: 120 minutes
Total Questions: 4

Round: Technical Interview
Experience: Question 1 : He tried to take the discussion to web based technologies to which I straightly told I don’t know. Not sure if that was a good decision. Nevertheless, he went over my resume a lot of times and asked about various projects.
Question 2 : Discussed the various projects related to it.
Question 3 : He asked this question because I had worked on django during my FB internship. I proposed a tree based structure. xyz.com/a/b/c ---> b is child of a, c is child of b.

Question 4 : Next he moved to a very interesting question. Given a simple text editor, I want to facilitate autocomplete feature. We discussed about syntactic methods using language specific keywords. I suggested a trie based implementation which he liked. Later he asked me to improve and redirected me to using scope of the variables, and grammar of the language. We discussed about all the steps I did in language translators lab (macrojava -> minijava -> typechecking -> miniIR -> microIR -> miniRA ->Mips) where we built a Java compiler in Java. We later hopped back to original question and I suggested that we can use grammar to to store multiple (nested kind of) tries for different scope. He asked me how would I define “scope”. He gave me a scenario which helped me come up with the nested trie structure
int a;
{
int b;
{
int c; //a b c can be used
}
{
int d; //a b d can be used
}
}
He then asked me details of how I would code. I said we could use the respective visitors and maintain the current trie root for scope. He liked it but I missed at 2 places :
1. He asked me about token generation used in a compiler and I said flex and bison. I was expected to elaborate a bit.
2. He asked me how the grammar is generated and how the visitors are invoked. I couldn’t explain properly because I was not thorough with it.
Tips: * Keep smiling in the interviews.
* My interviewer had hopped from Microsoft to Visa. We had a short detailed discussion on how the transition was and what drove him to do that.
* It’s always good to know about the company to pick up interesting discussions, read up latest articles and news
* The interviewers want to see if you are passionate about what they are building. Their PPT (Pre Placement Talk) was also focussed majorly on the technologies they are building.
* If you take a question in a direction, make sure you are very very thorough with it. I took it in the direction of compilers, but couldn't make the transition seamlessly because I wasn't thorough with a lot of things (like token generation, visitor invocation).
* Not sure if telling upfront that you don't know about web technologies when you are applying for a profile that might need it is a good idea or not.


Round: Technical Interview
Experience: I think he was a senior person and spoke very passionately about the work that is happening in visa Bangalore office.

Question 1 : I said maybe I should have learnt a little about web based technologies. I think he was looking for a more generic answer.
Question 2 : I went ahead with calculating the expected score where my score random variable = 1 with probability p, and 0 with probability (1-p). I conditioned that expected score of game1 > game2 which would give me the range of p. I goofed up the equations twice but he said he liked my approach and I was just there

Question 3 : I suggested building a graph where a node is a word and an edge means a transition, and then performing BFS. He said that was obvious and that he was more interested in knowing how I build the graph. I suggested a method to reduce the number of string comparisons by storing a count vector with each word. Count vector is a 26 length vector where count[i] = number of times that letter occurs in the word. I would do string comparison to identify neighbours only if the difference in count vectors in 2. Eg, cot = cat - a + o. String comparison is still needed because of false positives. Eg, oct = cat - a + o but cat -> oct is not a valid transition. He liked my approach and asked me to code, discussed the complexity.
Tips: * Don't be naive around a senior engineer. Be confident.
* Explain your approach before going ahead solving it. I missed that in Q1 and for a long time he didn't know what I was heading towards.
* Write clean code, practice coding on paper to make sure you write compilable code. Shabby code is a turn off.
* Show passion for the company you are applying for.

General Tips: * Be friendly and keep smiling.
* Know about the company, well in detail. Recent news, articles, acquisitions, organisational changes, new offices, new product, etc.
* Know about the volume the company handles, certain mind boggling figures, what the company *does not* do
* If you are introducing yourself as an expert in a certain field, be prepared for questions like "How will you contribute to our company with your expertise" type of questions.
* Be very very thorough with every single thing you write on your resume. A small point you weren't sure about might become the basis of your whole interview. Don't write things you are unsure of, or have worked very little on.
Skill Tips: * I think I didn’t take Visa very seriously. I was assuming they won’t take a undergrad and they won’t take me because I have 0 knowledge in web based technologies. I might have acted a little cocky.
* They had nice pie diagrams which shows that they had done thorough research about each and every candidate based on resume and the coding test.
* They value the coding test a lot.
* Be very thorough with the projects you write on resume. They will give you a problem which won't be straightforward and will map onto one of your course projects. You are expected to do the mapping seamlessly. Every bit of the discussion you have with the interviewer can be your next problem.
* Brush up on web based technologies if you can.
* There will be a HR round as well if you clear the technical interviews.

Skills: Maths(esp Probability), Design, Passion, Web Technologies, Technical Skill And Speaking Skill, Coding Skills
College Name: IIT Madras
Motivation: * Been the leader since more than half a century, been through the technological revolution.
* Revolutionising payments architecture. Building something of greatest need, so elegant and optimised, yet producing such consistent performance.
* Keeping up with the need of the generation by introducing features which are brand new. Eg, “all-purpose credit card”.
* Loved their PPT (Pre Placement Talk). Volume of the data and processing is IMMENSE. Billions of transactions in a year voluming up to trillions. More than 200 countries in the world --> these stats are HUGE.
* Fraud detection is a space I would have loved to work on given that I come from a Data Mining background.

Funny Moments: Chucked out before HR round :P

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Why would you like to join Visa and why?
  • Q2. Tell me about yourself

Interview Preparation Tips

Round: Test
Experience: Coding Questions were fairly standard ones.
Duration: 75 minutes
Total Questions: 42

Round: Interview
Experience: Networks based questions, firewalls, TCP/IP and other OSI layers

Round: Interview
Experience: Coding questions. Asked to code on paper. Questions on Object Oriented Design.

Skills: Networks basics, OOPs basics, Coding Skills
College Name: IIT Guwahati
Motivation: Profiles offered&#44; Package, Location

Interview Preparation Tips

Round: Test
Experience: Questions on
1. Programming: 10 Questions2. Machine Learning Hadoop MCQ: 6 Questions3. Networking MCQ: 6 Questions4. Operating System: 6 Questions5. Infrastructure: 6 Questions6. Application Security: 6 Questions
Tips: Questions were simple , except sections 2,5 unless you have a basic idea about it.
Duration: 75 minutes
Total Questions: 34+2

Round: Technical Interview
Experience: – Projects, Internship– Asymmetric and Symmetric encryption with some real world usage– Concepts behind Digital Signature and Digital Certificates– Detailed discussion on HTTPS– Basic OS concepts : Threads, Mutex , Semaphores– Basic OOPS concepts : Virtual functions , Function overloading and overriding , encapsulation.
Tips: Focus on Network Security concepts !

Round: Technical Interview
Experience: – Projects , Internship– Some discussion on Testing and how you would design a unit test case and a complete project test case. Discussion on Automated Testing.– How does a Web application work.– Software Development Models– Discussion on interpreted language and compiled language– Some DBMS basics for efficiency :- Indexing viz. B+trees , Hashing.– Some discussion on Apple Pay , VbV (Verified by Visa) (informal)

Round: HR Interview
Experience: Basic HR questions !

General Tips: Confidence is the key along with sufficient coding practice both on the IDE and pen-paper.
Skills: Network Security, Programming, Algorithms, Operating System
College Name: IIT ROORKEE

I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.

Interview Questionnaire 

7 Questions

  • Q1. Given an array, Implement Binary search tree
  • Ans. 

    Implement Binary Search Tree using given array of strings.

    • Sort the array in ascending order

    • Find the middle element and make it the root of the tree

    • Recursively create left and right subtrees using the left and right halves of the array

    • Repeat until all elements are added to the tree

  • Answered by AI
  • Q2. Given the above Binary search tree, print in ascending order
  • Ans. 

    Print the given Binary search tree in ascending order

    • Traverse the left subtree recursively

    • Print the root node

    • Traverse the right subtree recursively

  • Answered by AI
  • Q3. Given an array of stock prices, find where to buy and where to sell for maximum profit in O(n)
  • Ans. 

    Find buy and sell points for maximum profit in an array of stock prices in O(n)

    • Iterate through the array and keep track of the minimum price seen so far

    • Calculate the profit at each index by subtracting the minimum price from the current price

    • Update the maximum profit and buy/sell points accordingly

    • Return the buy and sell points for maximum profit

  • Answered by AI
  • Q4. Resume based
  • Q5. What are three problems Chennai faces?
  • Ans. 

    Chennai faces problems related to water scarcity, traffic congestion, and pollution.

    • Water scarcity due to inadequate rainfall and poor management of water resources.

    • Traffic congestion due to the increasing number of vehicles and poor road infrastructure.

    • Pollution caused by industries, vehicular emissions, and improper waste disposal.

  • Answered by AI
  • Q6. Which one would you solve and how and why?
  • Ans. 

    Need more context on the question to provide an answer.

    • Please provide more information on the problem to be solved.

    • Without context, it is difficult to provide a solution.

    • Can you please provide more details on the problem statement?

  • Answered by AI
  • Q7. What is most interesting thing about Visa?
  • Ans. 

    Visa is a global payments technology company that connects consumers, businesses, banks and governments in more than 200 countries and territories.

    • Visa operates the world's largest retail electronic payments network.

    • VisaNet, the company's global processing system, handles more than 65,000 transaction messages a second.

    • Visa is constantly innovating to improve payment security and convenience, with initiatives such as Vi...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: 4 Coding questions on Hackerrank platform, one and half hour time. I am not going to reveal the questions here, but one was a basic binary tree implementation and the other three were algorithmic and mathematical problems. They were kinda hard to solve in an hour and half. I could do only 1 and half of the other one. I got 115/300 points on that. I was one of the 16 people selected for the interview.
Tips: It all depends on how well you can focus on the test day. Just practice a lot on hackerrank.
Duration: 1 hour 30 minutes
Total Questions: 4

Round: Technical Interview
Experience: The first two questions I was able to do fast enough. I was also asked a few questions on my resume and coding-related internship. The last one, I showed an O(n*n) algorithm first and then modified it to O(n). Around 45 minutes.
Tips: Be thorough on the coding part in your resume. Think out aloud!

Round: Technical + HR Interview
Experience: Just a few normal questions regarding my projects and my favorite course and it's application to Visa. 15 minutes.
Tips: Once again, be thorough on your resume.

Round: HR Interview
Experience: Once again a normal round, just random questions as to whether I am interested and good enough in communication. 15 minutes.
Tips: Don't get shaken. Be ready for all kinds of questions. Especially about Visa relation to what you do

Skills: Smart Coding
College Name: IIT Madras

Skills evaluated in this interview

Bread Financial Interview FAQs

How many rounds are there in Bread Financial Software Engineer interview?
Bread Financial interview process usually has 1 rounds. The most common rounds in the Bread Financial interview process are Technical.

Tell us how to improve this page.

Bread Financial Software Engineer Interview Process

based on 1 interview

Interview experience

1
  
Bad
View more
Bread Financial Software Engineer Salary
based on 4 salaries
₹14 L/yr - ₹20 L/yr
99% more than the average Software Engineer Salary in India
View more details
Process Analyst
150 salaries
unlock blur

₹4 L/yr - ₹8 L/yr

Process Associate
143 salaries
unlock blur

₹3 L/yr - ₹6 L/yr

Senior Analyst
43 salaries
unlock blur

₹7.4 L/yr - ₹23.1 L/yr

AML Analyst
36 salaries
unlock blur

₹4 L/yr - ₹7.8 L/yr

Analyst
25 salaries
unlock blur

₹4 L/yr - ₹9.6 L/yr

Explore more salaries
Compare Bread Financial with

Paytm

3.3
Compare

Angel One

4.0
Compare

Truhome Finance

3.9
Compare

Unimoni

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