Filter interviews by
Clear (1)
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There were 3 interview rounds.
CRO (Conversion Rate Optimization) and SEO (Search Engine Optimization) techniques focus on improving website performance and visibility.
Implementing relevant keywords in meta tags and content for SEO
Optimizing website speed and mobile responsiveness for CRO
Creating compelling call-to-action buttons for CRO
Regularly monitoring and analyzing website traffic and user behavior for both CRO and SEO
Wordpress based page need to design with animation
Top trending discussions
I applied via Job lever and was interviewed before Sep 2021. There were 2 interview rounds.
Easy leetcode code 2 questions , HTML5 css javascript simple screen design
I was interviewed in Dec 2017.
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
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 ...
Implementing a shuffle function for a playlist of songs
Create a new empty playlist
Randomly select a song from the original playlist and add it to the new playlist
Remove the selected song from the original playlist
Repeat until all songs have been added to the new playlist
Return the new shuffled playlist
Memory leak is a situation where a program fails to release memory it no longer needs.
Memory leaks can cause a program to consume more and more memory over time, eventually leading to crashes or other issues.
Memory leaks can be caused by programming errors such as not freeing memory after it is no longer needed.
Tools like valgrind can be used to detect memory leaks in C and C++ programs.
Examples of memory leaks include...
Arrays have fixed size and can lead to memory wastage and performance issues.
Arrays have a fixed size and cannot be resized dynamically.
Inserting or deleting elements in an array can be time-consuming.
Arrays can lead to memory wastage if they are not fully utilized.
Arrays can cause performance issues if they are too large and need to be traversed frequently.
Arrays can also be prone to buffer overflow attacks.
Example: A...
Function to hide text on mouse click in JavaScript
Create a function that takes an element as input
Add an event listener to the element for a mouse click
Toggle the element's display property between 'none' and its original value
Find two elements in an unsorted array whose sum is equal to a given number x.
Use a hash table to store the difference between x and each element in the array.
Iterate through the array and check if the current element is in the hash table.
Return the pair of elements that add up to x.
BST stands for Binary Search Tree, a data structure used for efficient searching and sorting operations.
BST is a tree-like data structure where each node has at most two children.
The left child of a node contains a value less than the parent node, while the right child contains a value greater than the parent node.
BST allows for efficient searching and sorting operations with a time complexity of O(log n).
Examples of a...
Number of possible BSTs with 2 and 3 nodes.
For 2 nodes, only 2 BSTs are possible.
For 3 nodes, 5 BSTs are possible.
Number of BSTs can be calculated using Catalan numbers formula.
Catalan(2) = 2, Catalan(3) = 5.
Answering the question about possible trees with two and three nodes.
For two nodes, there is only one possible tree.
For three nodes, there are three possible trees.
The formula for calculating the number of possible trees with n nodes is (2n-3)!!.
The double exclamation mark represents the double factorial function.
The double factorial function is defined as n!! = n(n-2)(n-4)...(1 or 2).
B+ trees are balanced trees used for indexing and searching large amounts of data.
B+ trees are similar to binary search trees but have multiple keys per node.
They are commonly used in databases and file systems.
B+ trees have a high fanout, reducing the number of disk accesses required for searching.
They are also self-balancing, ensuring efficient performance even with large amounts of data.
Example: In a database, a B+ ...
Yes, I have a few questions.
Can you tell me more about the team I'll be working with?
What is the company culture like?
What are the biggest challenges the team is currently facing?
Can you walk me through the development process for a typical project?
What opportunities are there for professional growth and development?
I prefer hash tables for their constant time lookup and insertion.
Hash tables are efficient for storing and retrieving data.
They have constant time complexity for both insertion and lookup.
They can be implemented using arrays or linked lists.
Examples include Python's dictionary and Java's HashMap.
Yes, we can implement a stack using two queues.
Push operation: Enqueue the element to the first queue.
Pop operation: Dequeue all elements from the first queue and enqueue them to the second queue until the last element. Dequeue and return the last element. Swap the names of the queues.
Top operation: Same as pop operation but don't dequeue the last element.
Example: Push 1, 2, 3. Queue 1: 1 2 3. Queue 2: empty. Pop opera...
Find minimum no of platforms required to avoid collision between trains based on their arrival and departure times.
Sort both arrays in ascending order
Initialize platform count and max count to 1
Loop through both arrays and compare arrival and departure times
If arrival time is less than or equal to departure time, increment platform count
Else, decrement platform count
Update max count if platform count is greater than ma
JVM stands for Java Virtual Machine. It is an abstract machine that provides a runtime environment for Java programs.
JVM is responsible for interpreting the compiled Java code and executing it.
It provides platform independence by converting bytecode into machine-specific code.
JVM has various components like class loader, bytecode verifier, and execution engine.
Compiler converts source code into bytecode, while JVM exec...
I am a software engineer with experience in developing web applications and a passion for learning new technologies.
Experienced in developing web applications using technologies such as Java, Spring, and Angular
Passionate about learning new technologies and keeping up with industry trends
Strong problem-solving skills and ability to work in a team environment
Completed a Bachelor's degree in Computer Science from XYZ Uni
PayTM is an Indian e-commerce payment system and digital wallet company.
PayTM was founded in 2010 by Vijay Shekhar Sharma.
It started as a mobile recharge and bill payment platform.
PayTM has expanded to offer services like online shopping, movie ticket booking, and travel bookings.
It also offers a digital wallet that can be used to pay for various services and products.
PayTM has over 350 million registered users and is ...
I would like to add a feature for splitting bills among friends.
The feature would allow users to split bills for movies, dinners, etc.
Users can select friends from their contact list and split the bill equally or unequally.
The app would send a notification to the selected friends to pay their share.
The feature would make it easier for users to split expenses and avoid awkward conversations.
It would also encourage more
My favourite app is Spotify. I would like to see improvements in the algorithm for personalized playlists.
Improved algorithm for personalized playlists
Better integration with social media platforms
Option to create collaborative playlists with friends
My favourite subject is Computer Science.
I enjoy programming and problem-solving.
I find algorithms and data structures fascinating.
I am interested in artificial intelligence and machine learning.
I like learning about new technologies and keeping up with industry trends.
I choose NIT Hamirpur because of its excellent academic reputation and beautiful campus.
NIT Hamirpur has a strong focus on academics and research, which aligns with my career goals.
The campus is located in a serene and picturesque location, which provides a conducive environment for learning.
The faculty members are highly experienced and knowledgeable, and are always willing to help students.
The college has state-of-th...
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
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
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
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
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
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...
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.
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
Count the number of continuous sequences with equal number of 0's and 1's in an array.
Iterate through the array and keep track of the count of 0's and 1's encountered so far.
Store the difference between the counts in a hash table and increment the count for that difference.
If the difference is already present in the hash table, add the count to the existing value.
Return the sum of all values in the hash table.
Count the number of palindromic substrings in a given string.
A substring is a contiguous sequence of characters within a string.
A palindrome is a string that reads the same backward as forward.
Use dynamic programming to count all palindromic substrings.
Time complexity can be reduced to O(n^2) using Manacher's algorithm.
Find the longest palindrome in a given string in linear time complexity.
Use Manacher's algorithm to find the longest palindrome in a string in O(n) time complexity.
The algorithm involves preprocessing the string to add special characters to handle even and odd length palindromes.
Then, it uses a combination of dynamic programming and symmetry properties to find the longest palindrome.
For example, in the string 'babad',
The value of pie is a mathematical constant approximately equal to 3.14159.
Pie is the ratio of the circumference of a circle to its diameter.
It is an irrational number, meaning it cannot be expressed as a finite decimal or fraction.
Pie is commonly used in geometry and trigonometry calculations.
The value of pie is often approximated as 3.14 or 22/7.
I am a passionate software engineer with experience in developing web applications using various technologies.
Experienced in developing web applications using HTML, CSS, JavaScript, and frameworks like React and Angular
Proficient in backend development with Node.js and databases like MongoDB and MySQL
Familiar with version control systems like Git and deployment tools like Docker
Strong problem-solving skills and ability
Yes, I believe I will be able to fit in the company based on my experience, skills, and values.
I have experience working in diverse teams and adapting to different work cultures.
I share the company's values and vision, which align with my own.
I am eager to learn and contribute to the team, fostering a positive work environment.
I have strong communication skills, which are essential for collaboration and teamwork.
I was interviewed before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
It was in the morning, where there were 3 questions to answer.
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider all eight possible directions for connectivity while traversing the matrix.
Handle edge ca...
You are provided with an array called ARR
, consisting of distinct positive integers. Your task is to identify all the numbers that fall within the range of the smallest a...
Identify missing numbers within the range of smallest and largest elements in an array.
Find the smallest and largest elements in the array.
Generate a list of numbers within this range.
Filter out the numbers present in the array.
Return the missing numbers in sorted order.
Given a binary tree, your task is to count and return the number of leaf nodes present in it.
A binary tree is a data structure where each node has at most two children,...
Count and return the number of leaf nodes in a binary tree.
Traverse the binary tree and count nodes with both left and right children as NULL.
Use recursion to traverse the tree efficiently.
Leaf nodes have no children, so check for NULL left and right children to identify them.
Round duration - 20 minutes
Round difficulty - Medium
It was a system design round.
OLA app system design involves multiple components like user interface, driver matching algorithm, payment processing, etc.
User interface for booking rides and tracking
Driver matching algorithm based on location and availability
Payment processing for seamless transactions
Real-time tracking of rides for both users and drivers
Round duration - 45 minutes
Round difficulty - Medium
It was a DS Algo round.
Given a binary tree, your task is to determine the diagonal traversal of the tree.
1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
...
Diagonal traversal of a binary tree involves traversing nodes diagonally from top to bottom and left to right.
Traverse the tree level by level, starting from the root node.
For each level, keep track of the diagonal nodes and their children.
Use a queue to store nodes at each level and traverse them accordingly.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the diagonal traversal is 1 3 6 2 5 4 7.
You are required to determine the minimum number of taps that need to be opened to water an entire one-dimensional garden defined along the x-axis,...
Find the minimum number of taps to water an entire garden along the x-axis.
Iterate over the taps and find the farthest point each tap can reach.
Sort the taps based on their starting points and use a greedy approach to select the taps.
Keep track of the farthest point reachable by the selected taps and the number of taps opened.
Return the minimum number of taps needed to water the entire garden or -1 if it's impossible.
Round duration - 15 minutes
Round difficulty - Medium
HR Round
Tip 1 : Go through standard problems
Tip 2 : You should know about everything you have written on your resume
Tip 1 : Keep it short not more than 1 page.
Tip 2 : Write more about figures and technicality on your resume.
I was interviewed before Sep 2020.
Round duration - 45 minutes
Round difficulty - Easy
This round was telephonic round. The interview lasted for approximately 45 minutes. The interviewer asked me three coding questions. I hustled a bit on 3rd question but after a hint was able to solve it.
Round duration - 120 minutes
Round difficulty - Easy
This round was Online Test on Hackerrank for 120 minutes, it contained 3 questions.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Use a combination of hashmap and doubly linked list to implement the LRU cache.
Keep track of the least recently used item and evict it when the cache reaches its capacity.
Update the position of an item in the cache whenever it is accessed or updated.
Handle both get and put operations efficiently to main...
Round duration - 60 minutes
Round difficulty - Easy
This round was face to face Interview at Ola Campus and lasted for 1 hour.
Round duration - 35 minutes
Round difficulty - Easy
This round was again a face to face technical interview, I was just asked one question in this round.
Round duration - 30 minutes
Round difficulty - Easy
Only a question of System Design was asked
Design a toll booth system for Ola cabs with necessary functions and data structures.
Use a queue data structure to manage the order of vehicles waiting at the toll booth.
Implement functions for vehicle entry, toll calculation, and exit.
Store vehicle information such as license plate number, type of vehicle, and toll amount in a hash map.
Utilize a priority queue to handle VIP or premium customers efficiently.
Include a f...
Round duration - 30 minutes
Round difficulty - Easy
Very general HR questions were asked
Tip 1 : Be confident in the projects you have mentioned in your resume.
Tip 2 : Always discuss your approach with the interviewer first for any problem.
Tip 3 : Always start with a basic solution and then discuss further optimisations.
Tip 1 : Good projects showing your skills (Be clear in what you achieved from those projects)
Tip 2 : Internship experience at the top (It gives you an edge over others)
based on 1 interview
Interview experience
Software Engineer
56
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
43
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Engineer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Softwaretest Engineer
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Niramai Health Analytix
Ather Energy
Grey Orange
Freshworks