Filter interviews by
I applied via Company Website and was interviewed in Aug 2022. There were 2 interview rounds.
Top trending discussions
I appeared for an interview in Dec 2020.
Round duration - 60 minutes
Round difficulty - Medium
test timing: 7-8 pm
2 programming questions
webcam proctored
You are provided with an array ARR
of integers of size 'N' and an integer 'K'. The goal is to move from the starting index to the end of the array with the minimum possib...
Find minimum cost to reach end of array by jumping with constraints
Use dynamic programming to keep track of minimum cost at each index
Iterate through the array and update the minimum cost based on reachable indices within K steps
Calculate cost to jump from current index to reachable indices and update minimum cost accordingly
Tip 1 : Ability to apply data structures in questions(practice graph and Tree questions)
Tip 2 : Thorough knowledge of the projects done
Tip 3 : Good knowledge about computer science concepts
Tip 1 : Mention projects that you have done yourself and are thorough with
Tip 2 : mention soft skills
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Medium
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
The string 'S' should be evaluated in a case...
The task is to check whether a given string is a palindrome or not, considering only alphabets and numbers and ignoring symbols and whitespaces.
Convert the string to lowercase and remove all symbols and whitespaces.
Reverse the modified string and compare it with the original string.
If they are equal, then the string is a palindrome.
If not, then the string is not a palindrome.
Given a number N
, calculate its square root and output the integer part only.
18
4
The square root of 18 is approximate...
The task is to find the integral part of the square root of a given number.
Use the built-in square root function to find the square root of the number.
Convert the result to an integer by rounding down or using the floor function.
Print the integer part of the square root as the output.
Given a positive integer N
, your task is to determine the minimum number of steps required to reduce N
to 1.
1) Subtract 1 from it: n = n -...
The task is to find the minimum number of steps required to reduce a positive integer to 1 using three given operations.
Use dynamic programming to solve the problem efficiently.
Create an array to store the minimum steps required for each number from 1 to N.
Iterate from 2 to N and calculate the minimum steps for each number based on the three operations.
Return the minimum steps for N.
Round duration - 60 Minutes
Round difficulty - Medium
They started Fundamentals of OOP- Inheritance, Polymorphism
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
The maximum sum of any contiguous subarray in an array is found using Kadane's algorithm in O(N) time.
Initialize two variables, maxSum and currentSum, both set to the first element of the array.
Iterate through the array from the second element.
For each element, update currentSum by adding the element to it.
If currentSum becomes negative, reset it to 0.
If currentSum is greater than maxSum, update maxSum.
After iterating ...
Round duration - 30 Minutes
Round difficulty - Medium
Some people had two HR interviews but I only had one and interview went up till 11:30 pm and you get only 5-10 minutes to prepare for HR on Zoom
Tip 1 : Solve atleast 200 problems
Tip 2 : Focus on all data structures
Tip 3 : Build some good projects
Tip 1 : Keep it precise and concise.
Tip 2 : Build your resume yourself according your skills
posted on 11 Oct 2020
I applied via Naukri.com and was interviewed in Sep 2020. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in Feb 2020. There was 1 interview round.
I appeared for an interview before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Medium
The test was organized online on Amcat and there were 3 coding problems. There were no MCQs in this round.
Implement a function that determines whether a given numeric string contains any substring whose integer value equals the product of two consecutive integers. The functio...
Implement a function to determine if a numeric string contains a substring whose value equals the product of two consecutive integers.
Iterate through all substrings of the input string and check if their integer value equals the product of two consecutive integers.
Use nested loops to generate all possible substrings efficiently.
Check if the product of two consecutive integers matches the integer value of the substring.
...
Given a binary tree, a target node within this tree, and an integer K
, identify and return all nodes that are exactly K
edges away from the t...
Find nodes at a specific distance from a target node in a binary tree.
Traverse the binary tree to find the target node.
Perform a depth-first search to identify nodes at distance K from the target node.
Return the values of nodes found at distance K in an array.
Round duration - 50 Minutes
Round difficulty - Medium
This round was scheduled by the college Training and Placement team virtually. The interviewer asked me questions pertaining mainly to DSA and we discussed my projects.
You are given the head node of a singly linked list head
. Your task is to modify the linked list so that all the even-valued nodes appear before all the odd-v...
Reorder a singly linked list so that all even-valued nodes appear before odd-valued nodes while preserving the original order.
Create two separate linked lists for even and odd nodes
Traverse the original list and move nodes to respective even or odd lists
Merge the even and odd lists while maintaining the original order
Round duration - 60 Minutes
Round difficulty - Easy
Again, the round was virtual. This was a Tech + Managerial round organized by the college T & P cell. The interviewer asked questions related to fundamental subjects such as Operating Systems, Object-oriented programming, and DBMS. There was one coding round at the end.
Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal.
Consider lines at a...
Diagonal traversal of a binary tree involves printing nodes at 135 degree angle in between lines.
Traverse the tree in a diagonal manner, starting from the root node.
Maintain a map to store nodes at each diagonal level.
Print the nodes at each diagonal level in the order of traversal.
Round duration - 40 Minutes
Round difficulty - Easy
The round was virtual and was organized by the T & P cell of the college. The interviewer asked some behavioural and situation-based questions. There was one puzzle at the end.
Tip 1 : For a product-based company, the first important thing is to solve as many DSA problems as possible. I solved problems mainly on GeeksforGeeks, LeetCode, and Coding Ninjas.
Tip 2 : Prepare 2-3 good projects based on your technical skillset. Prepare it very well as there is a high chance that projects would be discussed in the interview.
Tip 3 : Prepare fundamental college subjects like Operating systems, Object-oriented Programming, Database Management.
Tip 1 : Keep it short and concise
Tip 2 : Describe your projects very specifically
I applied via Approached by Company and was interviewed before Oct 2021. There were 6 interview rounds.
Simple programming test from mettl website
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...
based on 1 review
Rating in categories
Software Engineer2
312
salaries
| ₹13.2 L/yr - ₹45 L/yr |
Software Engineer
261
salaries
| ₹12 L/yr - ₹47.1 L/yr |
Software Engineer III
228
salaries
| ₹17 L/yr - ₹70 L/yr |
Senior Software Engineer
223
salaries
| ₹14.9 L/yr - ₹53.1 L/yr |
Data Scientist
178
salaries
| ₹17 L/yr - ₹50 L/yr |
Paytm
Razorpay
Visa
MasterCard