Info Edge Sdet Interview Questions and Answers

I am currently working with Java and Selenium for test automation.

• Using Java programming language for writing test scripts

• Using Selenium WebDriver for automating web applications

• Integrating with CI/CD tools like Jenkins for continuous testing

• Working with frameworks like TestNG for test management

• Using tools like Maven for project management

Find the maximum subsequent distinct and contiguous subarray in a character array.

• Use a sliding window approach to iterate through the array.

• Keep track of the distinct characters in the current subarray.

• Update the maximum length and subarray as necessary.

Create a stack using 2 given queues.

• Push elements into one queue until it is full.

• When the first queue is full, push new elements into the second queue.

• To pop an element, remove all elements from the non-empty queue except the last one.

• Switch the non-empty queue to the other one when it becomes empty.

A test framework should have features like test case management, test data management, reporting, and integration with CI/CD tools.

• Test case management: Ability to create, organize, and execute test cases.

• Test data management: Ability to manage test data and generate test data sets.

• Reporting: Ability to generate detailed test reports with metrics and logs.

• Integration with CI/CD tools: Ability to integrate with tools li...read more

To check if each page of Amazon.com has its logo, we can use automated testing with Selenium WebDriver.

• Use Selenium WebDriver to navigate to each page of Amazon.com

• Locate the logo element on each page using its XPath or CSS selector

• Verify that the logo element is displayed on each page

Yes, I have worked on automation frameworks.

• I have experience in developing and maintaining automation frameworks using tools like Selenium, TestNG, and Cucumber.

• I have also worked on customizing existing frameworks to meet specific project requirements.

• I am familiar with both data-driven and keyword-driven frameworks.

• I have integrated automation frameworks with CI/CD pipelines for continuous testing.

• One example of a p...read more

When entering a URL and hitting enter, the browser performs DNS lookup, establishes a TCP connection, sends an HTTP request, receives the response, and renders the page.

• Browser performs DNS lookup to resolve the domain name to an IP address

• Browser establishes a TCP connection with the server

• Browser sends an HTTP request to the server

• Server processes the request and sends back an HTTP response

• Browser receives the respon

Program to find the angle between the hands of a clock given the time.

• Calculate the angle of the hour hand from 12 o'clock position

• Calculate the angle of the minute hand from 12 o'clock position

• Calculate the absolute difference between the two angles

• If the difference is greater than 180 degrees, subtract it from 360 degrees

• Return the absolute value of the difference as the angle between the hands

To find if two linked lists intersect, traverse both lists and compare their tail nodes.

• Traverse both linked lists and find their lengths

• If the lengths are different, move the longer list's head pointer to the difference in length

• Now traverse both lists and compare their nodes until a common node is found

• If no common node is found, the lists do not intersect

JOINS are used to combine rows from two or more tables based on a related column between them.

• JOINS are used to retrieve data from multiple tables in a single query

• There are different types of JOINS - INNER, LEFT, RIGHT, FULL OUTER

• JOINS are based on a related column between the tables

• Syntax: SELECT * FROM table1 JOIN table2 ON table1.column = table2.column

Combine 4 elements of a sorted array of size 7 and a sorted array of 3 elements to make a sorted array.

• Insert the 3 elements of the smaller array into the larger array

• Sort the larger array using any sorting algorithm

To check if a string is a palindrome, compare the first and last characters, then move towards the center.

• Remove all non-alphanumeric characters and convert to lowercase

• Use two pointers, one starting from the beginning and the other from the end

• Compare the characters at both pointers, move towards the center until they meet

• If all characters match, the string is a palindrome

Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

• Divide the array into two halves

• Recursively sort the two halves

• Merge the sorted halves

Find pairs of integers in a BST whose sum is equal to a given number.

• Traverse the BST and store the values in a hash set.

• For each node, check if (X - node.value) exists in the hash set.

• If yes, add the pair (node.value, X - node.value) to the result.

• Continue traversal until all nodes are processed.

Merge overlapping time intervals into mutually exclusive intervals.

• Sort the intervals based on their start time.

• Iterate through the intervals and merge overlapping intervals.

• Output the mutually exclusive intervals.

• Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

Different types of hashing and alternative for Linear Chaining

• Different types of hashing include division, multiplication, and universal hashing

• Alternative for Linear Chaining is Open Addressing

• Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

• AVL tree is a binary search tree with additional balance factor for each node.

• The balance factor is the difference between the heights of the left and right subtrees.

• Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

• Rotations are performed ...read more

Find the minimum number of squares whose sum equals to a given number n.

• Use dynamic programming to solve the problem efficiently.

• Start with finding the square root of n and check if it is a perfect square.

• If not, then try to find the minimum number of squares required for the remaining number.

• Repeat the process until the remaining number becomes 0.

• Return the minimum number of squares required for the given number n.

Insertion sort for a singly linked list.

• Traverse the list and compare each node with the previous nodes

• If the current node is smaller, swap it with the previous node

• Repeat until the end of the list is reached

• Time complexity is O(n^2)