Fourkites Senior Quality Assurance Engineer 2 Interview Questions and Answers

Q1. Find max sum of sub array
Ans. 
Find the maximum sum of a subarray within an array of integers.
• Iterate through the array and keep track of the current sum and maximum sum seen so far.

• If the current sum becomes negative, reset it to 0 as it won't contribute to the maximum sum.

• Return the maximum sum found after iterating through the entire array.
Answered by AI
Add your answer
Q2. What is throttling in js ?
Ans. 
Throttling in JavaScript is a technique used to control the rate at which a function is executed.
• Throttling limits the number of times a function can be called over a specified period.

• It is commonly used in scenarios like scroll events, resize events, and API requests to prevent performance issues.

• Example: Debouncing a search input to limit the number of API calls made while typing.
Answered by AI
Add your answer

Discussion about OOPS concepts and String related program

Program on Recursion and Array

Q1. Strength and Weakness
Add your answer
Q2. Reason for joining with company
Add your answer

Q1. About the experience and what I did
Add your answer

Give me a palindrom of string related question

Q1. System design based on how to scale something
Ans. 
To scale a system, consider horizontal and vertical scaling, load balancing, caching, database sharding, and microservices architecture.
• Implement horizontal scaling by adding more instances of the application to distribute the load.

• Consider vertical scaling by upgrading the hardware resources of the existing server.

• Use load balancing to evenly distribute incoming network traffic across multiple servers.

• Implement cachin...read more
Answered by AI
Add your answer

Given 3 strings S, S1, S2 containgin M, N and k characters respectively, task is to modify string by replaicing all substring S1 with S2 and S

Round duration - 120 minutes
Round difficulty - Medium

Due to pandemic placement process went virtual. Test was conducted at 10 A.M.

Q1. 
Decode String Problem Statement
Your task is to decode a given encoded string back to its original form.
Explanation:
An encoded string format is <count>[encoded_string], where the 'encoded_string...read more
Ans. 
The task is to decode an encoded string back to its original form by repeating the encoded string 'count' times.
• Parse the input string to extract the count and the encoded string within the brackets

• Use recursion to decode the encoded string by repeating it 'count' times

• Handle nested encoded strings by recursively decoding them

• Output the decoded string for each test case
Answered by AI
Add your answer
Q2. 
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...read more
Ans. 
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
• Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

• Once the loop is detected, use two pointers approach to find the start of the loop.

• Adjust the pointers to remove the loop and return the modified linked list.

• Example: For input 5 2 and 1 2 3 4 5, output should be 1 2 3 4 5.
Answered by AI
Add your answer
Q3. 
Infix to Postfix Conversion
You are provided with a string EXP which represents a valid infix expression. Your task is to convert this given infix expression into a postfix expression.
Explanation:
An i...read more
Ans. 
Convert a given infix expression to postfix expression.
• Use a stack to keep track of operators and operands.

• Follow the rules of precedence for operators (*, / have higher precedence than +, -).

• Handle parentheses by pushing them onto the stack and popping when closing parenthesis is encountered.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Due to pandemic placement process went virtual. Test was conducted at 2 P.M.

Q1. 
Find First Repeated Character in a String
Given a string 'STR' composed of lowercase English letters, identify the character that repeats first in terms of its initial occurrence.
Example:
Input:
STR =...read more
Ans. 
The task is to find the first repeated character in a given string of lowercase English letters.
• Iterate through the string and keep track of characters seen so far in a set.

• If a character is already in the set, return it as the first repeated character.

• If no repeated character is found, return '%'.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Video Call interview where the interview happened for around 45 minutes.

Q1. 
Maximum Sum Path in a Binary Tree Problem Statement
You are provided with a binary tree consisting of N nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...read more
Ans. 
Find the maximum sum achievable by a simple path between any two nodes in a binary tree.
• Traverse the binary tree to find all possible paths and calculate their sums.

• Keep track of the maximum sum encountered during traversal.

• Consider paths that may include the same node twice.

• Implement a recursive function to explore all paths in the tree.

• Optimize the solution to avoid redundant calculations.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Video Call interview where the interview happened for around 30 minutes.

Q1. Api optimisations, query optimisations, how to keep code more extensible, scalable etc
Add your answer

Q1. Questions related to designing around redis
Add your answer

Design notify me feature of Flipkart

DSA problems and lld question of splitwise

Q1. Tell me about yourself.
Add your answer