Filter interviews by
Mobile testing is more complex due to device fragmentation and different OS versions, while web testing is more standardized.
Mobile testing requires testing on various devices and OS versions
Mobile testing involves testing for different screen sizes and resolutions
Web testing is more standardized and involves testing on different browsers
Web testing involves testing for different screen sizes and resolutions as well
Mob...
I applied via Referral and was interviewed before Nov 2016. There were 6 interview rounds.
Top trending discussions
My day was productive and fulfilling. As for myself, I am a driven and detail-oriented individual with a passion for problem-solving.
I tackled several challenging tasks at work and made significant progress on each of them.
I also took some time to exercise and clear my mind, which helped me stay focused throughout the day.
As for myself, I have a background in engineering and enjoy using my analytical skills to find cre...
Optimizing code involves identifying and removing bottlenecks to improve performance.
Identify the parts of the code that are taking the most time to execute
Use efficient algorithms and data structures
Minimize the number of function calls and loops
Avoid unnecessary calculations or operations
Use caching or memoization to avoid repeating calculations
Profile the code to measure performance improvements
Optimized version of given code
Use efficient data structures and algorithms
Avoid unnecessary loops and conditions
Minimize function calls and variable assignments
My day was productive and fulfilling. As for myself, I am a driven and detail-oriented individual with a passion for problem-solving.
I tackled several challenging tasks at work and made significant progress on each of them.
I also took some time to exercise and clear my mind, which helped me stay focused throughout the day.
As for myself, I have a background in engineering and enjoy applying my analytical skills to a var...
Yes, I prefer coding in C and have read The C Programming Language book. I have also explored the concept of Inheritance in C.
I find C to be a powerful and efficient language for system programming.
Yes, I have read The C Programming Language book by Dennis Retchie and found it to be a great resource.
Recently, I have been exploring the concept of Inheritance in C through various online resources and tutorials.
While C do...
Inheritance allows a class to inherit properties and methods from another class.
Inheritance promotes code reusability and saves time and effort in programming.
It allows for the creation of a hierarchy of classes with shared characteristics.
For example, a class Animal can be inherited by classes such as Dog, Cat, and Bird, which share common properties and methods.
Inheritance can be implemented using the 'extends' keywo
Liskov substitution principle is a principle in object-oriented programming that states that objects of a superclass should be able to be replaced with objects of its subclasses without affecting the correctness of the program.
Subtypes must be substitutable for their base types
Derived classes must not change the behavior of the base class
Violating the principle can lead to unexpected behavior and errors
Example: A squar...
Explanation of OOPs concepts with programs
Encapsulation: Wrapping data and functions into a single unit. Example: Class in Java
Abstraction: Hiding implementation details and showing only necessary information. Example: Abstract class in C#
Inheritance: Acquiring properties and behavior of a parent class. Example: Child class extending parent class in Python
Polymorphism: Ability of an object to take many forms. Example:
Dynamic polymorphism is achieved through virtual functions and inheritance in object-oriented programming.
Create a base class with virtual functions
Create derived classes that override the virtual functions
Use pointers or references of the base class to call the virtual functions
The appropriate derived class function will be called based on the object being pointed to or referred to
Global variables can lead to unexpected changes and make debugging difficult.
Global variables can be accessed and modified from any part of the code, making it difficult to track changes.
They can cause naming conflicts if multiple variables with the same name are used in different parts of the code.
Using global variables can make it harder to test and debug code, as it can be difficult to isolate the cause of errors.
Th...
Using 'goto' can make code hard to read, maintain and debug.
Goto statements can create spaghetti code that is difficult to follow.
It can make it harder to understand the flow of the program.
It can also make debugging more difficult.
There are usually better alternatives to using goto, such as using loops or functions.
Some programming languages, such as Java and Python, do not even have a goto statement.
Using goto can al...
My favorite subject is history because it helps me understand the present and learn from the past.
I enjoy learning about different cultures and how they have evolved over time
I find it fascinating to study the causes and effects of major historical events
One of my favorite books on history is 'Guns, Germs, and Steel' by Jared Diamond
Implicit objects are pre-defined objects in JSP that can be accessed without being explicitly declared.
Implicit objects are created by the JSP container during the translation phase.
They can be accessed using predefined names such as request, response, session, application, out, pageContext, config, and exception.
For example, the request object can be used to retrieve parameters from a form or URL.
The session object ca...
Apache is a popular web server and Tomcat is a widely used application server.
Apache is an open-source web server that supports multiple operating systems and is known for its stability and security.
Tomcat is a Java-based application server that is used to deploy Java web applications and supports servlets and JSPs.
Other popular web servers include Nginx and Microsoft IIS.
Other popular application servers include JBoss...
To deploy a web application on Apache Tomcat, the application needs to be packaged as a WAR file and then deployed to the Tomcat server.
Create a WAR file of the web application
Copy the WAR file to the Tomcat webapps directory
Start the Tomcat server
Access the web application using the URL http://localhost:8080/
Collections in Java are classes that implement collections of objects, such as lists, sets, and
I applied via Referral
A program to swap two pointers.
Declare two pointers of the same data type
Assign the first pointer to a temporary variable
Assign the second pointer to the first pointer
Assign the temporary variable to the second pointer
Dijkstra's algorithm finds shortest path between nodes in a graph
Create a graph with nodes and edges
Initialize distances from source node to all other nodes as infinity
Set distance from source node to itself as 0
Create a set of unvisited nodes
While unvisited set is not empty, select node with minimum distance
For each neighbor of selected node, calculate distance from source node
If calculated distance is less than curre...
Floyd-Warshall's algorithm is used to find the shortest path between all pairs of vertices in a weighted graph.
Create a 2D array to store the distances between all pairs of vertices.
Initialize the array with the weights of the edges in the graph.
Use nested loops to iterate over all pairs of vertices and update the distances if a shorter path is found through a third vertex.
The final array will contain the shortest dist
Program to print matrix elements in spiral order recursively
Create a recursive function to print the elements in spiral order
Define the boundaries of the matrix and traverse the matrix in spiral order
Call the recursive function to print the elements in spiral order
Handle edge cases such as empty matrix or matrix with only one row/column
Find two numbers in an unsorted array that add up to a given sum in O(n)
Use a hash table to store the difference between the sum and each element in the array
Iterate through the array and check if the current element is in the hash table
If it is, return the current element and the corresponding difference
If not, add the current element to the hash table
Indexing is a technique used in DBMS to improve the performance of queries.
Indexing creates a separate data structure that allows faster retrieval of data.
It works by creating a pointer to the location of data in the table.
Indexes can be created on one or more columns of a table.
Types of indexing include B-tree, hash, and bitmap indexing.
Indexes can also be clustered or non-clustered.
Clustered indexes determine the phy...
B and B+ trees are data structures used for efficient searching and sorting of large datasets.
B trees are balanced trees used for disk-based storage systems.
B+ trees are similar to B trees but have all data stored in the leaf nodes for faster searching.
B trees have a variable number of keys per node, while B+ trees have a fixed number.
B trees have a higher fanout than B+ trees, making them more efficient for smaller da...
Program to find lowest common ancestor of two nodes in binary search tree and binary tree with brute force approach.
For binary search tree, traverse from root to both nodes and store the path. Then compare paths to find LCA.
For binary tree, traverse from root to both nodes and store the path. Then compare paths to find LCA.
Brute force approach involves checking each node's descendants to see if they contain both nodes.
...
Program to print all ancestors of a node in a binary tree
Create a recursive function to traverse the binary tree
Check if the current node is the target node
If yes, print all the nodes in the call stack
If not, recursively call the function for left and right subtrees
I applied via Company Website and was interviewed before Jun 2020. There were 3 interview rounds.
The weight of an aircraft is crucial for its performance and safety.
The weight of an aircraft includes the weight of the aircraft itself, fuel, passengers, cargo, and any other equipment on board.
The weight of an aircraft is measured in pounds or kilograms.
The weight of an aircraft affects its takeoff and landing performance, as well as its fuel efficiency and range.
Aircraft manufacturers provide maximum takeoff and la...
I want you to provide me with challenging software development projects that will help me grow as a developer.
Challenging projects that will push my skills to the limit
Opportunities to learn new technologies and programming languages
Collaborative work environment with experienced developers
Clear communication and feedback on my work
Opportunities for career growth and advancement
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.
based on 145 reviews
Rating in categories
Customer Care Executive
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Category Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
CCE
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Shopclues
Naaptol Online Shopping
SHOP CJ Network
Shop101