i
Paytm
Filter interviews by
Clear (1)
I applied via Naukri.com and was interviewed in Aug 2024. There was 1 interview round.
Experienced manager with a proven track record in leading teams to success through effective communication and strategic planning.
Over 10 years of experience in management roles
Strong leadership skills demonstrated through successful team projects
Effective communication and problem-solving abilities
Proven track record of meeting and exceeding goals
Strategic thinker with a focus on long-term planning
I applied via Campus Placement and was interviewed before Jun 2023. There were 2 interview rounds.
A case study is related to supply and demand.
Types of joins include inner join, outer join, left join, right join, and full join.
Inner join: Returns rows when there is a match in both tables.
Outer join: Returns all rows when there is a match in one of the tables.
Left join: Returns all rows from the left table and the matched rows from the right table.
Right join: Returns all rows from the right table and the matched rows from the left table.
Full join: Returns rows
Keys in database management are used to uniquely identify records in a table.
Primary Key: uniquely identifies each record in a table, must be unique and not null
Foreign Key: links two tables together, ensures referential integrity
Composite Key: combination of two or more columns to uniquely identify a record
Super Key: set of attributes that uniquely identifies a record
DBMS is a software system that manages databases, while R-DBMS is a relational database management system that stores data in tables with relationships.
DBMS stores data in files, while R-DBMS stores data in tables with relationships
DBMS does not support relationships between tables, while R-DBMS supports relationships through keys
R-DBMS ensures data integrity through normalization, while DBMS does not have this feature
I applied via Referral and was interviewed before Feb 2023. There were 2 interview rounds.
I applied via Referral and was interviewed before Dec 2020. There was 1 interview round.
I applied via Newspaper Ad and was interviewed before May 2022. There were 2 interview rounds.
45mins logical answers and quantitavie apptitude
Coding is based on dsa problem sloving
Nothing as usual you can go through company’s website
I applied via Naukri.com and was interviewed in Oct 2022. There were 4 interview rounds.
Sales, product marketing, trade marketing, Excel, MIS are all business-related terms.
Sales refers to the process of selling products or services to customers.
Product marketing involves promoting and advertising a specific product to potential customers.
Trade marketing focuses on promoting and selling products to retailers or wholesalers.
Excel is a software program used for data analysis and organization.
MIS (Management...
I was interviewed before Jan 2021.
Round duration - 90 minutes
Round difficulty - Medium
It was conducted in Hacker rank which consisted of 10 aptitude questions that included C, C++, Java MCQ. 2 programming questions were also given.
Given an N x M
matrix filled with integers, determine the minimum sum obtainable from a path that starts at a specified cell (x, y)
and ends at the top left corner of t...
The problem involves finding the minimum sum path from a specified cell to the top left corner of a matrix.
Start from the specified cell and calculate the minimum sum path to reach the top left corner using dynamic programming.
Consider the three possible moves: down, right, and down-right diagonal.
Keep track of the minimum sum at each cell and update it based on the minimum of the three possible moves.
Finally, the mini...
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use backtracking to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Recursively generate combinations by adding open parentheses if there are remaining, and closing parentheses if the number of open parentheses is greater than the number of clo...
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...
Create a program to count lowercase alphabets, digits, and white spaces from user input until '$' is encountered.
Read characters from input stream until '$' is encountered
Count lowercase alphabets, digits, and white spaces separately
Print the counts of each character type as three integers separated by spaces
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
The fir...
Find K largest elements in an unsorted array and return them in non-decreasing order.
Sort the array in non-decreasing order.
Return the last K elements of the sorted array.
To check internet connection on a system, you can use various methods like pinging a website or checking network status.
Use ping command to check connectivity to a website (e.g. ping www.google.com)
Check network status using network settings or command line tools
Try accessing a website or online service to verify internet connection
When you type a URL in a web browser, the browser sends a request to the server hosting the website, which then responds with the necessary files to display the webpage.
Browser checks cache for DNS resolution
If not found, browser sends a DNS query to resolve the domain name to an IP address
Browser establishes a TCP connection with the server
Browser sends an HTTP request to the server for the webpage
Server processes the...
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?
Implement counting sort algorithm to sort an array of integers without comparisons.
Count the frequency of each element in the input array.
Calculate the prefix sum of frequencies to determine the position of each element in the sorted array.
Place each element in its correct position based on the prefix sum.
Time complexity of counting sort is O(n+k), where n is the number of elements and k is the range of input.
Example: ...
The Fibonacci series has applications in various fields such as mathematics, computer science, art, and nature.
Used in algorithms for optimization problems and dynamic programming.
Found in nature, such as the arrangement of leaves on a stem, the branching of trees, and the spiral shapes of shells.
Applied in financial markets for predicting stock prices and analyzing market trends.
Utilized in art and design for creating
Round duration - 30 minutes
Round difficulty - Easy
HR round where the interviewer asked questions to know more about me.
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.
based on 6 interviews
Interview experience
based on 49 reviews
Rating in categories
Team Lead
2.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
1.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
1.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
974
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
915
salaries
| ₹0 L/yr - ₹0 L/yr |
BharatPe
Zerodha
Razorpay
Mobikwik