Filter interviews by
Common troubleshooting steps for VPN include checking network connectivity, verifying credentials, restarting VPN service, and updating software.
Check network connectivity to ensure the VPN server is reachable
Verify credentials to ensure correct username and password are being used
Restart the VPN service on the client device or server
Update VPN software to the latest version to fix any known issues
I appeared for an interview 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 applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 70 minutes
Round difficulty - Easy
The first round was the Online Coding Round of 70 minutes with 3 problems of 3 marks, 3 marks, and 4 marks respectively.
The first two questions were easy and the third one was a bit tricky. The round started at 6 PM.
Anyone who is practicing continuously could have solved these questions easily within the time limit. The test cases were also not so hard and distinct. I coded in C++ language.
The questions asked were-
1. Minimum insertions required to make a string palindrome
2. To find the distance of the closest leaf from a node with given data.
3. Add two numbers represented by linked lists
22 students were selected for the next round.
Determine the minimal number of characters needed to insert into a given string STR
to transform it into a palindrome.
STR = "abcaa"
The task is to find the minimum number of characters needed to insert into a given string to make it a palindrome.
Use dynamic programming to find the longest palindromic subsequence of the given string.
Subtract the length of the longest palindromic subsequence from the length of the original string to get the minimum insertions required.
Handle edge cases like an empty string or a string that is already a palindrome.
Exa...
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...
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 using BFS or DFS.
Keep track of the distance from 'X' to each leaf node encountered during traversal.
Return the minimum distance found as the output.
Given two singly linked lists, with each list representing a positive number without leading zeros, your task is to add these two numbers and return the result in the form of a new...
Add two numbers represented by linked lists and return the result as a new linked list.
Traverse both linked lists simultaneously while adding corresponding elements and carry over the sum if needed
Handle cases where one linked list is longer than the other
Create a new linked list to store the sum of the two numbers
Round duration - 80 minutes
Round difficulty - Easy
It was a technical interview. The platform used was google meet for online video calling. The interviewer first introduced himself then asked me to introduce myself. He also asked about my well-being amid the Covid-19 pandemic. He asked me 3 problems from data structures. He put a lot of focus on my project. We discussed about my project for about 20 mins. He asked various questions related to my project and I answered them confidently. After 70-75 mins he said that interview was over and that I may ask him anything. I asked him to give me feedback about my resume and my project. He gave me advice to improve my resume and the interview was over. The first technical interview was easy and was not so challenging as I was prepared.
Given an array of integers ARR
with length 'N' and an integer 'Target', the task is to find all unique pairs of elements that add up to the 'Target'.
First line: Integer...
Find all unique pairs of elements in an array that add up to a given target sum.
Use a hashmap to store the difference between the target sum and each element as keys and their indices as values.
Iterate through the array and check if the current element's complement exists in the hashmap.
Return the pairs of elements that add up to the target sum.
Sort the given array of integers in ascending order using the quick sort algorithm. Quick sort is a divide-and-conquer algorithm where a pivot point is chosen to partition the...
Implement quick sort algorithm to sort an array of integers in ascending order.
Choose a pivot element (e.g., rightmost element) to partition the array into two subarrays.
Recursively apply quick sort on the subarrays until the entire array is sorted.
Time complexity can be optimized to NlogN for worst-case scenarios.
Given a sequence of numbers, denoted as ARR
, your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Implement the Merge Sort algorithm which involves dividing the array into two halves, sorting each half, and then merging them back together.
Recursively call the Merge Sort function on each half of the array until the base case of having a single element in the array is reached.
Merge the sorted halves back together in a new array in no...
Round duration - 60 minutes
Round difficulty - Medium
This was also a technical round. The interviewer focused on data structures and resume. Apart from some basic questions about my resume, he asked majorly about data structures and algorithms. The interview was an hour long and he asked only 2 problems. Both of them were from trees. In this round, he focused if I can change my approach if a slight change is made in the question. Like he asked me to write code for inorder traversal. Obviously, I used a recursive approach. He then asked me to use the iterative method to find inorder traversal of the tree.
The questions he asked were-
1. Inorder traversal (both recursive and iterative method)
2. Level Order Traversal
( For obvious reasons I knew level order traversal very well. I coded it swiftly, so he asked me to write code for Zig-Zag traversal)
Find the inorder successor of a given node in a binary tree. The inorder successor is the node that appears immediately after the given node during an inorder traversal....
Find the inorder successor of a given node in a binary tree.
Perform an inorder traversal of the binary tree to find the successor of the given node.
If the given node has a right child, the successor will be the leftmost node in the right subtree.
If the given node does not have a right child, backtrack to the parent nodes to find the successor.
Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.
In zigzag order, level 1 is printed from left to right...
Implement a function to print the zigzag traversal of a binary tree.
Use a queue to perform level order traversal of the binary tree.
Maintain a flag to switch between printing nodes from left to right and right to left at each level.
Store nodes at each level in a list and reverse the list if the flag is set to print in zigzag order.
Round duration - 50 minutes
Round difficulty - Medium
This was the final round of the Interview process. My interview was scheduled for 7.30 PM. It started at approximately 7.40 PM. The main focus of the interviewer was on my projects and my skills. He asked me many questions regarding my project like what problems I faced, what did you learn from this, apart from developing skills what else did you learn while developing the project, why did you use this tech instead of this, security features, scalability of the project and many more. I answered almost every question as perfectly as I can. Later he asked me some basic questions from NodeJS (as I am a full stack developer). In the end, he asked a puzzle. I didn't know the solution to the puzzle but we discussed it and I figured out the solution.
Tip 1 : Properly grasp Data Structures and Algorithms from basics.
Tip 2 : Learn about Time complexity
Tip 3 : Be honest and walk through your thought process to the interviewer.
Tip 4 : Its always good to be presentable and have good communications skills
Tip 1 : Never Lie on your resume. Only write what you have done and what you know.
Tip 2 : It's good to have one or two projects on your resume. Mention the tech stack you used and a brief description of the project. It will be best if you host/upload your project on the cloud.
Tip 3 : Avoid unnecessary details like Hobbies, family details, declaration, date, signature, etc.
Tip 4 : You're more than a 1-page resume. But your resume should not be more than a page
I applied via Campus Placement and was interviewed before Jun 2020. There was 1 interview round.
based on 1 interview
Interview experience
Software Engineer2
310
salaries
| ₹15 L/yr - ₹45 L/yr |
Software Engineer
256
salaries
| ₹12 L/yr - ₹47.5 L/yr |
Software Engineer III
226
salaries
| ₹17 L/yr - ₹70 L/yr |
Senior Software Engineer
214
salaries
| ₹14.9 L/yr - ₹52.2 L/yr |
Data Scientist
173
salaries
| ₹16.9 L/yr - ₹50 L/yr |
Paytm
Razorpay
Visa
MasterCard