i
EASEBUZZ
Filter interviews by
I was interviewed in Jan 2025.
Check if a string of brackets is valid by ensuring every opening bracket has a corresponding closing bracket.
Use a stack data structure to keep track of opening brackets
Iterate through the string and push opening brackets onto the stack
When a closing bracket is encountered, pop the top element from the stack and check if it matches the closing bracket
If the stack is empty at the end of the iteration, the string is vali
Django models for school database with classes, students, and teachers.
Create a School model with a name field
Create a Class model with a foreign key to School and a primary teacher field
Create a Student model with a foreign key to Class
Use ForeignKey and OneToOneField relationships in Django models
Fetch all classes with more than 50 students using ORM query.
Use ORM query to filter classes with student count greater than 50
Join tables to get class information along with student count
Optimize query for better performance
I applied via Recruitment Consulltant and was interviewed in Jun 2024. There were 2 interview rounds.
select_related and prefetch_related are query optimization techniques in Django to reduce the number of queries executed when accessing related objects.
select_related is used to retrieve related objects in a single query using a SQL JOIN operation
prefetch_related is used to retrieve related objects in separate queries to avoid duplicate data retrieval
select_related is suitable for foreign key and one-to-one relationshi...
Page load in browser is the process of fetching and rendering a web page.
Browser sends a request to the server for the web page
Server processes the request and sends back the HTML, CSS, and JavaScript files
Browser renders the content and executes the scripts to display the page
Page load time can be affected by factors like server response time, network speed, and browser cache
I applied via Company Website and was interviewed before Jan 2024. There was 1 interview round.
The detailed process of searching for google.com involves DNS resolution, HTTP request, server response, and rendering the webpage.
1. User enters 'google.com' in the browser address bar.
2. Browser checks cache for DNS resolution, if not found, sends a DNS query to resolve the domain name to an IP address.
3. Browser sends an HTTP request to the resolved IP address for google.com.
4. Google's server processes the request,...
EASEBUZZ interview questions for popular designations
I applied via Naukri.com
The controversy between Asheer Grover and BharatPe
Easebuzz is a payment gateway platform that enables businesses to accept online payments easily.
Easebuzz offers a variety of payment options including credit/debit cards, net banking, UPI, and wallets.
One of the products I liked the most from Easebuzz is their recurring payment feature, which allows businesses to set up automatic payments for subscription-based services.
Another product I found useful is their payment l...
I applied via Company Website and was interviewed before May 2023. There was 1 interview round.
Financial statements and analysis tools used in financial reporting and decision-making.
Profit and Loss Statement (P&L): Shows a company's revenues, expenses, and profits over a specific period of time.
Cash Flow Statement: Reports a company's sources and uses of cash during a specific period, showing how changes in balance sheet accounts and income affect cash and cash equivalents.
Balance Sheet: Provides a snapshot of ...
Easebuzz is a payment gateway platform that enables businesses to accept online payments easily.
Payment gateway platform
Facilitates online payments for businesses
Offers easy integration for websites and apps
A balance sheet is a financial statement that provides a snapshot of a company's financial position at a specific point in time.
It shows a company's assets, liabilities, and shareholders' equity.
Assets are what the company owns, liabilities are what it owes, and shareholders' equity is the difference between the two.
The balance sheet follows the accounting equation: Assets = Liabilities + Shareholders' Equity.
It helps ...
Top trending discussions
I was interviewed in Sep 2020.
I was interviewed before Mar 2021.
Round duration - 70 minutes
Round difficulty - Easy
there was some coding questions and some mcqs related to js, html, css, java and aptitude.
Given an undirected graph with V vertices and E edges, your task is to find all the bridges in this graph. A bridge is an edge that, when removed, increases the number of...
Find all the bridges in an undirected graph by identifying edges that, when removed, increase the number of connected components.
Use Tarjan's algorithm to find bridges in the graph.
Keep track of the discovery time and low time of each vertex during DFS traversal.
An edge (u, v) is a bridge if low[v] > disc[u].
Handle multiple test cases efficiently to find bridges in each graph.
Ensure the output contains the count of
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...
The task is to find the maximum amount of money Mr. X can rob from houses arranged in a circle without alerting the police.
The problem can be solved using dynamic programming.
Create two arrays to store the maximum amount of money robbed when considering the first house and when not considering the first house.
Iterate through the array and update the maximum amount of money robbed at each house.
The final answer will be
Tip 1 : Do 300+ questions on IB or leetcode or gfg
Tip 2 : Must do DSA course of coding ninjas for clear understanding
Tip 3 : Must complete CS subjects also
Tip 1 : not add too much things
Tip 2 : be confident that you write in CV
I was interviewed before Mar 2021.
Round duration - 90 Minutes
Round difficulty - Easy
MCQ based on web and oops.
Given two binary trees, T and S, determine whether S is a subtree of T. The tree S should have the same structure and node values as a subtree of T.
Determine if one binary tree is a subtree of another binary tree based on their structure and node values.
Traverse through the main tree and check if any subtree matches the second tree
Use recursion to compare nodes of both trees
Handle edge cases like empty trees or null nodes
Check if the root node of the second tree exists in the main tree
Round duration - 50 Minutes
Round difficulty - Easy
This round involved a discussion of a project I had undertaken recently and a coding problem. How does an Angular application work? List out differences between AngularJS and Angular
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
The task is to find the number of distinct ways to climb from the 0th step to the Nth step, where each time you can climb either one step or two steps.
Use dynamic programming to solve this problem
Create an array to store the number of ways to reach each step
Initialize the first two elements of the array as 1 and 2
For each subsequent step, the number of ways to reach that step is the sum of the number of ways to reach t...
Round duration - 80 Minutes
Round difficulty - Medium
The interview mostly focused on coding problems and Java-related concepts.
A Linked List in Java is implemented using nodes with references to the next node. It is preferred over an ArrayList when frequent insertions and deletions are required.
In Java, a Linked List is implemented using a Node class with data and a reference to the next Node.
LinkedList class in Java provides methods like add(), remove(), and get() for manipulating the list.
Linked List is preferred over ArrayList when frequent...
Given a positive integer 'N', representing the number of tasks, and a list of dependency pairs, determine if it is possible to complete all tasks considering thes...
Determine if it is possible to complete all tasks considering prerequisites.
Create a graph representation of the tasks and dependencies.
Use topological sorting to check if there is a cycle in the graph.
Return 'Yes' if no cycle is found, 'No' otherwise.
You are provided with an array 'Arr' containing 'N' distinct integers and a positive integer 'K'. Your task is to find the Kth smallest and Kth largest e...
Find the Kth smallest and largest elements in an array.
Sort the array to easily find the Kth smallest and largest elements.
Ensure K is within the array's size to avoid errors.
Handle multiple test cases efficiently.
Consider edge cases like when N is small or K is at the extremes.
Round duration - 30 Minutes
Round difficulty - Easy
This was the Hiring Manager Round. What is a Primary Key? What is a Cross-Join? What is the difference between Clustered and Non-clustered index?
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...
Given a sorted N * N matrix, find the position of a target integer 'X'.
Iterate over rows and columns to search for the target integer 'X'.
Utilize the sorted nature of the matrix to optimize the search process.
Return the position of 'X' if found, else return '-1 -1'.
Tip 1 : Practice Standard Dynamic Programming and Graph Theory Questions
Tip 2 : If you know Java, Be well versed with Fundamentals
Tip 3 : Have atleast one Good Project you can talk about
Tip 1 : Keep it Concise
Tip 2 : Only Mention Stuff you know
Some of the top questions asked at the EASEBUZZ interview -
The duration of EASEBUZZ interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 9 interviews
Interview experience
based on 53 reviews
Rating in categories
2-4 Yrs
Not Disclosed
3-6 Yrs
Not Disclosed
7-10 Yrs
Not Disclosed
Senior Business Development Manager
22
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Manager
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Manager
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
PhonePe
Mobikwik
Freecharge