Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Mar 2023. There were 2 interview rounds.
Regression testing is testing the existing functionality of the software after making changes to ensure that the changes have not affected the existing functionality. Retesting is testing the same functionality again after fixing the defects found during regression testing.
Regression testing is done to ensure that the changes made to the software have not affected the existing functionality.
Retesting is done to ensure ...
300 represents multiple choices and 301 represents moved permanently.
300 status code represents multiple choices, indicating that the requested resource has multiple representations available.
301 status code represents moved permanently, indicating that the requested resource has been permanently moved to a new URL.
Both status codes are used in HTTP responses to indicate the status of a requested resource.
Examples of 3...
Sanity testing and Smoke testing are types of software testing performed to check the basic functionality of the application.
Smoke testing is a type of testing that checks whether the critical functionalities of the application are working fine or not.
Sanity testing is a type of testing that checks whether the bugs reported earlier have been fixed or not.
Smoke testing is performed after the build is received from the d...
Severity is the impact of a defect on the system, while Priority is the order in which defects should be fixed.
Severity is based on the extent of damage caused by a defect
Priority is based on the importance of the affected functionality
High Severity and High Priority defects should be fixed first
Example: A spelling mistake in a button label has low Severity but high Priority if it affects usability
High priority means the issue needs to be fixed immediately, while low severity means the issue has minimal impact on the system.
High priority issues are critical and can cause system failure or data loss
Low severity issues are minor and do not affect the system's functionality
Example of high priority and low severity issue: A critical security vulnerability is high priority but low severity because it has not yet been...
Low priority and high severity refer to the impact and urgency of a bug respectively.
Low priority bugs are those that do not have a significant impact on the system or user experience, but still need to be fixed eventually.
High severity bugs are those that have a significant impact on the system or user experience and need to be fixed urgently.
For example, a low priority bug could be a typo in a non-critical error mess...
Agile methodology is an iterative approach to software development that emphasizes flexibility and customer satisfaction.
Agile values individuals and interactions over processes and tools
It emphasizes working software over comprehensive documentation
It encourages collaboration between developers and customers
It involves breaking down projects into smaller, manageable chunks called sprints
Examples of Agile methodologies...
The test that should be done first is the one that covers the most critical and high-risk functionality.
Identify critical and high-risk functionality
Prioritize tests based on risk
Perform tests in a logical order
Re-evaluate test priorities as development progresses
Top trending discussions
I applied via LinkedIn and was interviewed in Sep 2021. There was 1 interview round.
Intro & Product Description and type of solutions
I applied via Naukri.com and was interviewed in Jan 2024. There were 2 interview rounds.
I believe I am the right fit for the job because of my strong background in finance and my passion for marketing.
I have a solid understanding of financial principles and analysis, which can be applied to managing accounts effectively.
I have developed strong analytical and problem-solving skills in finance, which can be valuable in identifying marketing opportunities and optimizing strategies.
I have a keen interest in m...
The program capitalizes the first letter of each reversed word in a sentence.
Split the sentence into an array of words using space as a delimiter.
Reverse each word in the array and capitalize the first letter.
Join the modified words back into a sentence.
Probability of a horse going out of a chessboard in 'n' steps.
The total number of possible moves for a horse is 8.
The probability of going out of the board depends on the position of the horse.
For example, if the horse is at a corner, the probability of going out of the board is higher.
The probability can be calculated using combinatorics and geometry.
Algorithms for manipulating arrays and strings in coding
Use sorting algorithms like quicksort and mergesort for arrays
Use string manipulation functions like substring and replace for strings
Use dynamic programming for optimizing solutions to array and string problems
Designing a large scale Ad Server
Use distributed systems for scalability
Implement caching for faster ad delivery
Ensure high availability and fault tolerance
Use real-time bidding for efficient ad placement
Implement fraud detection mechanisms
Ensure compliance with privacy regulations
Maximum sub sequence sum in an array
Use Kadane's algorithm
Initialize max_so_far and max_ending_here to 0
Iterate through the array and update max_ending_here and max_so_far
Return max_so_far
Endianness refers to the byte order of a system. It determines how multi-byte data types are stored in memory.
Little-endian systems store the least significant byte first, while big-endian systems store the most significant byte first.
Endianness can affect the way data is transmitted between systems.
To determine the endianness of a system, you can use the byte order mark (BOM) or write a test program that checks the by...
Sort an array of 0's and 1's only.
Use two pointers, one at the beginning and one at the end of the array.
Swap 0's from the beginning with 1's from the end until the pointers meet.
Alternatively, use a counting sort algorithm to count the number of 0's and 1's and then reconstruct the array.
Heaps are data structures used to efficiently find the maximum or minimum element in a collection.
Max heap: parent nodes are always greater than or equal to child nodes
Min heap: parent nodes are always smaller than or equal to child nodes
Heaps are commonly used in priority queues and sorting algorithms
Heap operations include insert, delete, and extract max/min
Example: An array [3, 8, 2, 5, 1, 4, 6] can be represented a
Find 3 numbers in an array where a+b=c.
Loop through the array and check for all possible combinations of a and b.
Use a hash table to store the values of a and b, and check if c is present in the hash table.
Sort the array and use two pointers to find a and b, and then check if their sum equals c.
I applied via Campus Placement
I am an avid traveler and have visited over 20 countries
I love experiencing new cultures and trying new foods
I have backpacked through Europe and Asia
I have volunteered in orphanages in Cambodia and Nepal
Mobile advertising platform
Adtech
Mobile marketing
App monetization
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Data Analyst
57
salaries
| ₹3 L/yr - ₹9.2 L/yr |
Business Analyst
52
salaries
| ₹4.4 L/yr - ₹14 L/yr |
SEO Executive
44
salaries
| ₹2 L/yr - ₹4.8 L/yr |
Assistant Manager
41
salaries
| ₹4 L/yr - ₹10.5 L/yr |
Accounts Manager
40
salaries
| ₹4.5 L/yr - ₹9.6 L/yr |
Epsilon
Denave
Smollan Group
ChannelPlay