Filter interviews by
I am a dedicated Test Engineer with a strong background in software testing and quality assurance.
Experienced in creating test plans and test cases
Proficient in automated testing tools such as Selenium
Skilled in identifying and documenting software defects
Strong analytical and problem-solving skills
Excellent communication and teamwork abilities
I have a strong background in testing methodologies and a proven track record of delivering high-quality results.
I have extensive experience in manual and automated testing
I am detail-oriented and have a keen eye for identifying bugs and issues
I have excellent communication skills, which helps in collaborating with cross-functional teams
I am proactive in suggesting improvements to the testing process, leading to more e
Top trending discussions
I was interviewed before Feb 2024.
There were two coding questions; one was related to linked lists, and the other was linked to binary trees.
Developed a web application for tracking inventory and sales data
Used React for front-end development
Implemented RESTful APIs using Node.js and Express for back-end
Utilized MongoDB for database management
Integrated authentication and authorization features for secure access
Implemented data visualization using Chart.js
Reversing a linked list involves changing the direction of pointers to go from the end to the beginning.
Start by initializing three pointers: current, previous, and next.
Iterate through the linked list, updating the pointers to reverse the direction of the links.
Update the head of the linked list to point to the new first node, which was the original last node.
Program to find perfect squares between two numbers
Iterate through numbers between the given range
Check if the square root of the number is an integer
If yes, then it is a perfect square
Smart pointers in C++ are objects that act like pointers but provide automatic memory management.
Smart pointers help prevent memory leaks by automatically managing memory allocation and deallocation.
Examples include unique_ptr, shared_ptr, and weak_ptr.
unique_ptr is used for exclusive ownership, shared_ptr for shared ownership, and weak_ptr to prevent circular references.
Mutual exclusion is a concept in concurrent programming where only one thread can access a shared resource at a time.
Ensures that only one thread can access a critical section of code at a time
Prevents race conditions and data corruption
Commonly implemented using locks, semaphores, or mutexes
Example: Using a mutex to protect a shared variable in a multi-threaded application
Implementing multithreading involves creating and managing multiple threads to execute tasks concurrently.
Identify the tasks that can be executed concurrently
Create and manage multiple threads to execute these tasks simultaneously
Use synchronization techniques like locks and semaphores to prevent race conditions
Handle communication and coordination between threads
Consider thread safety and resource sharing issues
The test was in hackerrank platform, it was moderate level.
I applied via Campus Placement
Dsa problems dp and tress problem
I am a passionate software engineer with 5 years of experience in developing web applications using various technologies.
5 years of experience in software development
Proficient in developing web applications
Skilled in using various technologies
Passionate about software engineering
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
Dp, trees and basic time complexity
I am a software engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
5 years of experience in software development
Proficient in Java, Spring, and Angular
Strong problem-solving skills
Experience working in Agile development environment
Search for a target value in a 2D matrix efficiently.
Use binary search on rows to find the potential row where the target value may exist.
Then use binary search on that row to find the target value.
Find quadraplets in an array that sum up to a target value.
Use a nested loop to iterate through all possible combinations of quadraplets.
Keep track of the sum of each quadraplet and compare it to the target value.
Return the quadraplets that match the target sum.
I was interviewed before May 2016.
I am a passionate software engineer with experience in developing web applications and a strong background in computer science.
Experienced in developing web applications using technologies such as HTML, CSS, JavaScript, and React
Strong background in computer science with knowledge of data structures and algorithms
Proficient in programming languages such as Java, Python, and C++
Familiar with Agile development methodolog
Flipkart is a leading e-commerce platform in India with a strong focus on technology and innovation.
Flipkart offers a challenging and dynamic work environment for software engineers.
The company has a strong reputation for investing in technology and innovation.
Flipkart has a large user base and offers opportunities to work on a variety of projects.
The company has a strong focus on customer satisfaction and user experie...
Yes, I am comfortable with reallocating as needed.
I am flexible and adaptable to changing circumstances.
I have experience working in dynamic environments where priorities can shift.
I am willing to take on new challenges and responsibilities as required.
I have a strong technical background, excellent problem-solving skills, and a proven track record of delivering high-quality software.
Extensive experience in software development, including proficiency in multiple programming languages such as Java, Python, and C++
Strong problem-solving skills demonstrated through successful completion of complex projects
Proven track record of delivering high-quality software on time a...
I applied via Naukri.com and was interviewed before Jun 2020. There were 4 interview rounds.
I applied via Company Website and was interviewed before Feb 2021. There were 2 interview rounds.
Aptitude text
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 interview
Interview experience
Software Engineer
55
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Devops Engineer
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Nazara Technologies
Dream11
Octro
Games2Win