AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
GetePay UI Developer Interview Questions and Answers
GetePay UI Developer Interview Experiences
1 interview found
Abhinay sharma
(1 Question)
- Q1. Ask about the project
Interview questions from similar companies
Mohit Gupta
I appeared for an interview in Dec 2017.
Interview Questionnaire
3 Questions
- Q1. You need to find the maximum water pond formed in bw the building
- Ans.
To find the maximum water pond formed between buildings.
Identify the lowest point between the buildings.
Calculate the area of the pond using the distance between the buildings and the depth of the pond.
Consider any obstacles or uneven ground that may affect the pond's shape.
Use a surveying tool or satellite imagery to get accurate measurements.
Take into account any drainage systems or natural water flow that may affect
- Q2. On mars you have to place n robots and they are connected via GPS. now you need to move each robot such that the whole mars is visited and each robot visit the minimum area(meaning no overlapping of area)...
- Q3. Design dictionary using trie....having operations of inserting a word, updating and deleting (needed to write full running code)
- Ans.
Design a dictionary using trie with insert, update and delete operations.
Implement a Trie data structure with nodes containing a character and a boolean flag to indicate end of word
For insert operation, traverse the trie and add nodes for each character in the word
For update operation, delete the existing word and insert the updated word
For delete operation, mark the end of word flag as false and delete the node if it ...
Interview Preparation Tips
Experience: Simple questions
Duration: 1 hour 10 minutes
Total Questions: 3
College Name: IIT Guwahati
Skills evaluated in this interview
MAYANK DEEP
Interview Preparation Tips
Experience: There were 3 Questions . One on String manipulation and two were on Binary Trees. All were easy but there was time constraint.
Tips: Practice as many question as possible.
Duration: 60 minutes
Total Questions: 3
Round: Technical Interview
Experience: I was given the problem to design a car pooling system complete with the required classes .. data structures which would be used ... how the database would look like etc..
Tips: General understanding of databases and OOP concepts would do.
Round: Technical Interview
Tips: Be thorough and have in-depth knowledge of each and every point of your resume.
College Name: BITS Pilani
Surpriya Arora
Interview Questionnaire
21 Questions
- Q1. Discussion of previous written test questions
- Q2. Find the odd repeating element from a set of repeating elements
- Ans.
Find the odd repeating element from an array of strings
Use a hash table to count the frequency of each element
Iterate through the hash table to find the element with an odd count
- Q3. A 2D matrix is given which is row wise and column wise sorted. Find a particular element from it
- Ans.
Finding an element in a sorted 2D matrix
Start from the top right corner or bottom left corner
Compare the target element with the current element
Move left or down if the target is smaller, else move right or up
Repeat until the target is found or all elements are checked
- Q4. SQL Query to find Nth highest salary from table
- Ans.
SQL query to find Nth highest salary from table
Use ORDER BY and LIMIT clauses
Use subquery to get the Nth highest salary
Handle cases where there are less than N distinct salaries
- Q5. Another basic SQL query
- Q6. Write a function that returns '3' when '4' is passed as an input and vice versa without using if-else condition
- Ans.
Function to swap '3' and '4' without using if-else
Use XOR operator to swap the values
Convert the input to ASCII code and perform the swap
Use a lookup table to map the values
- Q7. Question on Suffix trees
- Q8. Question on Tries
- Q9. Question on Ternary search trees
- Q10. Question on hash maps
- Q11. Question on complexity of an algorithm
- Q12. 3-4 SQL queries
- Q13. Question on SQL joins
- Q14. JAVA questions on static block,static function and static variables
- Q15. JAVA questions on memory initialization and references
- Q16. Puzzle on measuring exactly half a glass of water
- Q17. Introduce yourself
- Ans.
I am a software developer with experience in Java and Python.
Proficient in Java and Python programming languages
Experience in developing web applications using Spring framework
Familiarity with database management systems like MySQL and MongoDB
- Q18. Why PAYTM?
- Ans.
PAYTM is a leading digital payment platform in India with a wide range of services.
PAYTM has a user-friendly interface and offers a seamless payment experience.
It provides a variety of services like mobile recharges, bill payments, and online shopping.
PAYTM has a strong focus on security and fraud prevention measures.
It has a large user base and is widely accepted by merchants across India.
PAYTM is constantly innovatin...
- Q19. Will you go for further studies?
- Ans.
Yes, I am open to pursuing further studies in the future.
I believe in continuous learning and staying updated with the latest technologies.
Further studies can help me specialize in a particular field and enhance my skills.
I may consider pursuing a master's degree in computer science or a related field.
However, my immediate focus is on gaining practical experience and contributing to the organization.
- Q20. Why do you think has PAYTM grown so fast?
- Ans.
PAYTM grew fast due to its innovative approach and early adoption of digital payments.
Early adoption of digital payments in India
Innovative approach with features like mobile recharges, bill payments, and cashback offers
Expansion into e-commerce and financial services
Strategic partnerships with major companies like Uber and Alibaba
- Q21. (looking at my CGPA of 9) You can get a better company. Then Why PAYTM only?
Interview Preparation Tips
Experience: there were 20 mcqs and 2 coding questions. It was a pen and paper test. We were given 1 hour to solve it. The mcqs were of average difficulty. The 2 coding questions were:
1. A variation of the standard Josephus Problem
2. Find the 'x' largest elements from 'n' input elements without using sorting.
Tips: They focus on algorithms not on complete solutions. Do not leave any question unattempted. If you do not know the exact approach then use Brute-Force approach.
Round: Technical Interview
Experience: The Interviewer was very nice. He was focussing on the approach used not on codes.
Tips: Be calm and think by basics :)
Round: Technical Interview
Experience: The interviewer asked high level data structures in this round. But again he saw the approach used and not exact solution
Tips: Don't give up. Tell whatever you know
Round: Technical Interview
Experience: JAVA questions were based on very detailed concepts. Study OOP properly.
Tips: Maintain your calm :)
Round: HR Interview
Experience: Overall the experience was nice and smooth.
Tips: If they allow you to ask them any question then ask them something about the company. They should find you interested in the company :)
General Tips: Just be cool. Show them you are enthusiastic to learn and work. While prepration focus on Basics and Algorithms. Prepare DBMS nicely too :)
Skill Tips: Have full knowledge about your projects
Skills: JAVA, Data Structures, Operating systems, Network Programming, DBMS
College Name: NIT Jalandhar
Motivation: PAYTM is a perfect mix for the dynamic startup culture and stability of a big organiztaion. PAYTM has an amazing work culture and excellent opportunities for growth
Skills evaluated in this interview
Interview Preparation Tips
College Name: na
I applied via Referral and was interviewed before Oct 2020. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. First they ask tell me about yourself and second they give you any topic to speak continues for 5 minutes. They check only your grammer if someone is not comfortable to that topic you can tell them to give...
Interview Preparation Tips
I appeared for an interview in Sep 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
3 coding Questions:
1st : Easy question based on simple loop iteration
2nd :Medium level Dp question
3rd : Medium level tree question(where we were not just required to complete the tree function but to build whole bst from
scratch)
It was conducted from 1:30 - 3:00 pm.
The coding platform was very good (as auto indentation and auto completion of brackets were there)
having camera on.
- Q1.
Selling Stock Problem Statement
You are given the stock prices for
Ndays. Each dayisignifies the price of a stock on that day. Your goal is to calculate the maximum profit that can be achieved by buyin... - Ans.
Calculate maximum profit by buying and selling stocks on different days.
Iterate through the stock prices and buy on the day when the price is lower than the next day's price, and sell on the day when the price is higher than the next day's price.
Keep track of the total profit earned by summing up the differences between buying and selling prices.
Return the total profit as the maximum profit that can be earned.
- Q2.
Minimum Time to Burn a Binary Tree from a Leaf Node
You are given a binary tree with 'N' unique nodes, and a specific start node from where the fire will begin. The task is to determine the time in minute...
- Ans.
The task is to determine the time in minutes required to burn the entire binary tree starting from a given node.
Traverse the tree from the given start node to calculate the time taken to burn the entire tree.
Use a queue to keep track of nodes and their burning time.
Increment the burning time for each level of nodes until the entire tree is burned.
(1 Question)
Round duration - 75-80 minutes
Round difficulty - Hard
This was a completely technical coding round where I was asked to solve the problems of data structures.
The codepad where i was asked to code was fine,
The interviewer was very friendly and was helpful and understanding.
I also asked him about his work and experience in the company and some other questions.
- Q1.
Matrix Maximum Path Sum Problem
Given an N*M matrix filled with integer numbers, your task is to find the maximum path sum starting from any cell in the first row and ending at any cell in the last row. Y...
Round duration - 45 minutes
Round difficulty - Easy
It was held on Gmeet platform
The interviewer was very experienced person and was very nice too.
He made me comfortable by first introducing himself in a very detailed way and then asking me mine introduction
Since I feel that his internet connection was not very good so he turned off his camera but I decided not to turn off mine as in online interviews your face reviles your confidence
the interviewer mostly asked me questions about my interests in technical field and the project that I have done
Interview Preparation Tips
Tip 1 : Practice atleast(easy and medium questions from leetcode under(Top Interview Questions)) and all the questions from Gfg under(must to do coding questions for interviews))
Tip 2 : Don't learn each and every question you solved but try to solve question in a way that you can solve its variation during interviews
Tip 3 : Do one project(one is enough) which you can explain with full technical details (why you used this technology, and all logics you applied in implementation)
Tip 4: Atleast read the round 1 (Coding round) Archives from (Geeks for geeks or Glassdoor). To get your mind prepared for the types of questions that company usually asks.(Coding round is the toughest Step in the whole Process to clear)
Tip 1: Have at least one project which you have made yourself and you should know all the technical questions related to that project (I feel project domain hardly matters like web development or android or ML/AI)
Tip 2: You should Put only those skills in resume :
1. Which the company requires (eg if you know company doesn't require Networking domain knowledge so
don't include it unnecessary if you are not much confident in it)
2. For on campus internships resume shortlisting is very easy so don't add anything unnecessary which might
cause you pain during interview.
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. About wireshark,linux common shell command
I appeared for an interview before Sep 2020.
(3 Questions)
Round duration - 70 minutes
Round difficulty - Medium
Timing: 6:00 pm
3 coding questions of medium to be solved in 70 minutes.
- Q1.
Maximum Subarray Sum Problem Statement
Given an array of numbers, the task is to find the maximum sum of any contiguous subarray of the array.
Input:
The first line of input contains the size of the arr...
- Ans.
Find the maximum sum of any contiguous subarray in an array of numbers in O(N) time.
Use Kadane's algorithm to find the maximum subarray sum in O(N) time.
Initialize two variables: maxEndingHere and maxSoFar to keep track of the maximum sum.
Iterate through the array and update the variables accordingly.
Return the maxSoFar as the result.
- Q2.
Closest Leaf in a Binary Tree
Ninja is stuck in a maze represented as a binary tree, and he is at a specific node ‘X’. Help Ninja find the shortest path to the nearest leaf node, which is considered an ex...
- Ans.
Find the minimum distance from a given node to the nearest leaf node in a binary tree.
Traverse the binary tree from the given node 'X' to find the nearest leaf node.
Use a queue for level order traversal to efficiently find the nearest leaf node.
Calculate the distance from node 'X' to each leaf node and return the minimum distance.
- Q3.
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
- 0 - representing an empty cell
- 1 - representing a fre...
- Ans.
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process of oranges.
Track the time taken to rot all fresh oranges and return the result.
If any fresh oranges remain after simulation, return -1 as it is impossible to rot all oranges.
(1 Question)
Round duration - 45 minutes
Round difficulty - Medium
Timing: 2:00 pm
Online round over google meet, code at google docs.
The interviewer was friendly, encouraging, and humble.
- Q1.
Smallest Integer Not Representable as Subset Sum
Given a non-decreasing sorted array
ARRofNpositive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from... - Ans.
The task is to find the smallest positive integer value that cannot be represented as a sum of elements of any proper subset of the given array.
The array is sorted in non-decreasing order, so we can iterate through the array and keep track of the maximum sum we can form.
If the current element is greater than the maximum sum + 1, then the maximum sum + 1 is the smallest positive integer that cannot be represented.
If all...
(1 Question)
Round duration - 45 minutes
Round difficulty - Medium
Timing: 2:00 pm
Online round over google meet, code at google docs.
The interviewer was not speaking much. It was a bit strange.
- Q1.
Bottom Right View of Binary Tree Problem Statement
Your task is to identify and return the bottom right view of a given binary tree.
This involves viewing the binary tree from an angle of 45 degrees from...
- Ans.
Identify and return the bottom right view of a given binary tree by viewing it from an angle of 45 degrees from the bottom right side.
Traverse the binary tree in a right-to-left manner and keep track of the last node encountered at each level.
Use a queue for level order traversal and update the result array with the last node at each level.
Return the result array sorted in ascending order as the bottom right view of th
Round duration - 30 Minutes
Round difficulty - Easy
Timing: 7:00 pm
The interviewer was friendly and in a bit of a hurry.
Interview Preparation Tips
Tip 1 : DSA is the key. Starting from scratch, one can become proficients in a couple of months.
Tip 2 : Solve questions just a bit outside your comfort zone. Solve too easy to too hard questions is not of any use.
Tip 3 : Be consistent, make a habit of following good coding practices.
Tip 4 : Get to know the ins and out of your projects. You must be very confident while explaining those.
Tip 5 : Don't just directly to system-design, brush up on OOPS principles, networks, OS, DBMS before that.
Tip 1: Keep it crisp and to the point. Make bullet points.
Tip 2: Bold the things you want to be paid attention to. Use numbers rather than vague sentences.
Tip 3: Only put the things you are confident about.
Tip 4: Don't put things irrelevant to the job, it only dilutes the main content.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
Round duration - 45 minutes
Round difficulty - Medium
I applied thorough LinkedIn and got a call from HR for the interview.
I went to their Noida Office.
First round was mainly focused on Javascript fundamentals.
Interviewer was also friendly.
(2 Questions)
Round duration - 1 hour
Round difficulty - Medium
Second round was after 15 minutes of the first round. The focus of this round was DS & Algorithms.
- Q1.
Find Subarray with Given Sum
Given an array
ARRofNintegers and an integerS, determine if there exists a subarray (of positive length) within the given array such that the sum of its elements equalsS.... - Ans.
Given an array and a target sum, find a subarray that sums up to the target sum.
Iterate through the array while keeping track of the running sum and the starting index of the subarray.
Use a hashmap to store the running sum and its corresponding index.
If the running sum - target sum is found in the hashmap, it means a subarray with the target sum exists.
Return the starting and ending indices of the subarray or [-1, -1]
- Q2.
Minimum Number of Platforms Required
You are provided with two arrays,
ATandDT, representing the arrival and departure times of all trains arriving at a railway station.Your task is to determine the m...
- Ans.
This question asks to find the minimum number of platforms required at a railway station so that no train needs to wait.
Sort the arrival and departure times arrays in ascending order.
Initialize a variable 'platforms' to 1 and 'maxPlatforms' to 1.
Iterate through the arrival and departure times arrays simultaneously.
If the current arrival time is less than or equal to the current departure time, increment 'platforms'.
If ...
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
- Q1. What JavaScript questions did he ask you during the managerial round, and can you describe the work culture of his team?
- Ans.
The interviewer asked about JavaScript questions and the work culture of the team during the managerial round.
JavaScript questions related to closures, prototypes, event handling, and asynchronous programming may have been asked.
Work culture may involve collaboration, innovation, agile methodologies, and continuous learning.
Examples of work culture could include regular team meetings, code reviews, hackathons, and ment
Round duration - 15 minutes
Round difficulty - Easy
Interview Preparation Tips
Tip 1 : Be strong at your basics.
Tip 2 : Don't hesitate to ask questions to interviewer.
Tip 3 : Prepare good for DS & Algo as most companies have a separate round for it.
Tip 1: If possible make 1 page resume
Tip 2: Don't put too many things. Keep it simple. If you're a fresher and have good projects, do put them before your academic section.
Tip 3: Be ready to explain everything you have in your resume.
Skills evaluated in this interview
GetePay Interview FAQs
Tell us how to improve this page.
GetePay Interviews By Designations
Interview Questions for Popular Designations
- UI UX Developer Interview Questions
- Front end Developer Interview Questions
- Web Developer Interview Questions
- Backend Developer Interview Questions
- Software Developer Intern Interview Questions
- Senior UI Developer Interview Questions
- Junior Software Developer Interview Questions
- Full Stack Software Developer Interview Questions
- Show more
GetePay UI Developer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
|
Java Developer
24
salaries
|  ₹2.4 L/yr - ₹6 L/yr |
|
Business Development Manager
7
salaries
| ₹3 L/yr - ₹4.8 L/yr |
|
UI Developer
6
salaries
| ₹2.4 L/yr - ₹3 L/yr |
|
Flutter Developer
5
salaries
| ₹4.2 L/yr - ₹5.3 L/yr |
|
Front end Developer
4
salaries
| ₹1.8 L/yr - ₹4.5 L/yr |
Paytm
PhonePe
Mobikwik
Freecharge
- Home >
- Interviews >
- GetePay Interview Questions >
- GetePay UI Developer Interview Questions
