Filter interviews by
I applied via Company Website and was interviewed in Mar 2024. There were 2 interview rounds.
Write a full PRD and 12 page slide in 2 days
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
I applied via Referral and was interviewed before Nov 2023. There was 1 interview round.
Basic aptitude test, if you know basic maths you can easily crack it.
I applied via Approached by Company and was interviewed before May 2022. There were 3 interview rounds.
JetSynthesys interview questions for popular designations
I applied via LinkedIn and was interviewed in Jun 2020. There were 3 interview rounds.
Implemented AI-powered recommendation engine to suggest personalized products based on user behavior.
Developed machine learning algorithms to analyze user data and suggest relevant products.
Implemented user feedback system to continuously improve recommendations.
Increased sales by 20% and customer satisfaction by 15%.
Reduced manual effort required for product selection and increased efficiency.
I would improve my favorite product by adding more customization options.
Add more color options for the product
Allow users to choose their preferred font style
Include the option to add personalized text or images
Provide different sizes or shapes for the product
Top trending discussions
Different question were asked on sql python java
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
I was interviewed in Dec 2016.
My final year project was about developing a mobile application for tracking and managing personal finances.
Developed a user-friendly interface for inputting and categorizing expenses
Implemented features for setting budgets and generating reports on spending habits
Utilized data encryption to ensure the security of financial information
I was involved in the testing phase of the SDLC in my project.
Participated in creating test cases and executing them
Collaborated with developers to identify and fix bugs
Ensured the quality of the software before release
During my internship, I was responsible for assisting with various tasks such as data analysis, project management, and client communication.
Assisted with data analysis by collecting and organizing data sets
Managed projects by creating timelines, delegating tasks, and tracking progress
Communicated with clients to gather feedback and provide updates on project status
I want to join Jio because of its innovative and disruptive approach in the telecom industry.
Jio has revolutionized the telecom industry with its affordable data plans and high-speed internet.
I am impressed by Jio's commitment to digital transformation and its focus on providing cutting-edge technology to its customers.
Jio's extensive network coverage and strong infrastructure make it an exciting company to work for.
I ...
Yes, abstract classes can be declared in Java.
Abstract classes cannot be instantiated
They can have abstract and non-abstract methods
Subclasses must implement all abstract methods
Example: abstract class Animal { abstract void makeSound(); }
Example: class Dog extends Animal { void makeSound() { System.out.println("Bark"); }}
Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as if they were of the same class.
Polymorphism is achieved through method overriding and method overloading.
Method overriding is when a subclass provides its own implementation of a method that is already provided by its parent class.
Method overloading is when a class has multiple methods with the same n...
Recursion allows for elegant and concise code, simplifies complex problems, and can be more efficient in certain cases.
Recursion can simplify complex problems by breaking them down into smaller subproblems.
It allows for elegant and concise code, especially when dealing with data structures like trees and graphs.
Recursion can be more efficient in certain cases, such as when calculating factorials or Fibonacci numbers.
Ho...
I was interviewed before Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.
Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.
If there is no K-th la...
Find the K-th largest element in a BST.
Perform reverse in-order traversal of the BST to find the K-th largest element.
Keep track of the count of visited nodes to determine the K-th largest element.
Return -1 if there is no K-th largest element in the BST.
Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:
Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.
Check if the left subtree is balanced
Check if the right subtree is balanced
Calculate the height difference between the left and right subtrees
Return 'True' if all conditions are met, otherwise return 'False'
Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.
Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.
Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.
Orphan p...
Round duration - 60 Minutes
Round difficulty - Medium
This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .
Given a string S
of length L
, determine the length of the longest substring that contains no repeating characters.
"abac...
Find the length of the longest substring without repeating characters in a given string.
Use a sliding window approach to keep track of the longest substring without repeating characters.
Use a hashmap to store the index of each character in the string.
Update the start index of the window when a repeating character is found.
Calculate the maximum length of the window as you iterate through the string.
Return the maximum le
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q
queries. Each query is represented by an integer Q[i]
, and you must ...
Search for integers in a rotated sorted array efficiently.
Use binary search to efficiently search for integers in the rotated sorted array.
Handle the rotation of the array while performing binary search.
Return the index of the integer if found, else return -1.
Given an array ARR
and an integer K
, your task is to count all subarrays whose sum is divisible by the given integer K
.
The first line of input contains an...
Count subarrays with sum divisible by K in an array.
Iterate through the array and keep track of the prefix sum modulo K.
Use a hashmap to store the frequency of each prefix sum modulo K.
For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.
Handle the case when prefix sum itself is divisible by K.
Return the total count of subarrays with sum divisible by K.
Round duration - 50 Minutes
Round difficulty - Medium
In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.
Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.
The ceil of an integer is defined as the s...
Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.
Traverse the BST to find the closest value greater than or equal to the key.
Compare the key with the current node value and update the ceil value accordingly.
Recursively move to the left or right subtree based on the comparison.
Return the ceil value once the traversal is complete.
Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:
1. INSERT(key, value): Add or update t...
Design a constant time data structure to maintain mappings between keys and values with various operations.
Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.
Keep track of the number of key-value pairs for GET_SIZE operation.
Check if the hash table is empty for IS_EMPTY operation.
Return true or false for SEARCH operation based on key existence.
Return the value associated...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed before Jan 2021.
Round duration - 90 Minutes
Round difficulty - Hard
I found the online coding round of Flipkart to be quite difficult based on the constraints of the problem and their time limits. I coded the first problem quite easily but on the second and the third problem , my code could only pass a few test cases and gave TLE for most of them. Both the questions required very efficient solution and the last 5 to 10 Test Cases carried more weight than the rest so I didn't get through this round.
Given three non-negative integers N, M, and K, compute the Kth digit from the right in the number obtained from N raised to the power M (i.e., N ^ M).
The first line contains ...
The task is to find the Kth digit from the right in the number obtained from N raised to the power M.
Iterate through the digits of N^M from right to left
Keep track of the position of the current digit
Return the digit at position K from the right
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
Iterate through the buildings and create a list of critical points (x, y) where the height changes.
Sort the critical points based on x-coordinate and process them to form the skyline.
Merge consecutive horizontal segments of equal height into one to ensure no duplicates.
Return the fin...
You are provided with a string STR
of length N
. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...
Identify the longest palindromic substring in a given string.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found
Return the longest palindrome with the smallest start index
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 5 interviews
Interview experience
based on 80 reviews
Rating in categories
3-5 Yrs
Not Disclosed
4-5 Yrs
Not Disclosed
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