i
Bread Financial
Filter interviews by
Top trending discussions
I appeared for an interview before Sep 2020.
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.
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...
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.
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...
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...
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...
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
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.
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...
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 ...
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...
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...
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’.
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 ...
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
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.
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...
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.
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...
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.
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.
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 ...
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
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.
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.
I applied via Referral and was interviewed before May 2021. There were 3 interview rounds.
I dont remember exact questions but they are like leetcode easy and medium
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
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
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
I applied via Campus Placement and was interviewed before Jun 2020. There was 1 interview round.
I applied via Company Website
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...
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.
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...
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
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
Print the given Binary search tree in ascending order
Traverse the left subtree recursively
Print the root node
Traverse the right subtree recursively
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
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.
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?
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...
based on 1 interview
Interview experience
Process Analyst
150
salaries
| ₹4 L/yr - ₹8 L/yr |
Process Associate
143
salaries
| ₹3 L/yr - ₹6 L/yr |
Senior Analyst
43
salaries
| ₹7.4 L/yr - ₹23.1 L/yr |
AML Analyst
36
salaries
| ₹4 L/yr - ₹7.8 L/yr |
Analyst
25
salaries
| ₹4 L/yr - ₹9.6 L/yr |
Paytm
Angel One
Truhome Finance
Unimoni