Kuliza Technologies Software QA Engineer Interview Questions and Answers

2 Leetcode Medium questions on hackerrank

Q1. Kadane algorithm based question
Add your answer
Q2. Leetcode medium
Add your answer
Q3. Resume based questions
Add your answer

Q1. Probability question math problem
Add your answer
Q2. Puzzle to solve
Add your answer
Q3. AI based question
Add your answer
Q4. 1 question to solve Leetcode medium
Add your answer

Q1. OOPs related questions.
Add your answer
Q2. Joins, Indexes and some problems to write sql queries.
Add your answer

Medium to hard questions based on arrays, dp

Q1. Quick sort algorithm
Ans. 
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
• Divides array into smaller sub-arrays based on a pivot element

• Recursively sorts sub-arrays

• Combines sorted sub-arrays to get final sorted array

• Time complexity: O(n log n) on average, O(n^2) worst case

• Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Answered by AI
Add your answer
Q2. Modified rotate a matrix
Ans. 
Rotate a matrix by 90 degrees in place
• Transpose the matrix

• Reverse each row of the transposed matrix
Answered by AI
Add your answer

2 Query question and 3 coding questions

Q1. Basic oops , Java script and Networking questions.
Add your answer
Q2. What is object orienteered programming.
Ans. 
Object oriented programming is a programming paradigm based on the concept of objects, which can contain data and code.
• Objects are instances of classes, which define the structure and behavior of the objects.

• Encapsulation, inheritance, and polymorphism are key principles of object oriented programming.

• Example: Java, C++, Python are popular languages that support object oriented programming.
Answered by AI
Add your answer
Q3. Different Events in java script
Ans. 
Events in JavaScript are actions or occurrences that happen in the browser that the code can respond to.
• Events can be triggered by user actions (like clicking a button), browser actions (like page load), or system events (like a timer expiring)

• Event listeners are used to listen for and respond to events

• Common events include click, mouseover, keydown, submit, etc.
Answered by AI
Add your answer
Q4. Event listeners
Add your answer

Project , coding question, DBMS

Q1. Basic personal details
Add your answer

2 DSA questions Both are from DP

Q1. 2 Questions , 1 is DSA
Add your answer
Q2. Second question is Puzzle
Add your answer

Q1. Pointless basic questions is what they asked
Add your answer

Q1. They had this round for hours together
Add your answer

Q1. Mimic Dataframe Merge
Ans. 
Implement a function to mimic the functionality of merging two DataFrames in Python.
• Create a function that takes two DataFrames as input.

• Merge the two DataFrames based on a common column or index.

• Handle different types of joins like inner, outer, left, and right joins.

• Return the merged DataFrame as output.
Answered by AI
Add your answer
Q2. Improve above case by case
Add your answer

1 hour - Find longest palindromic substring

60 Minutes coding test was there

Q1. Worst experience ever, never apply for company in this, highly unstable company
Add your answer
Q2. Add two numbers in a linked list, don't apply
Ans. 
Traverse the linked list and add the values of each node without using additional data structures.
• Traverse the linked list while keeping track of the sum in a variable

• Update the sum by adding the value of each node as you traverse the list

• Handle carry over if the sum of two nodes is greater than 9
Answered by AI
Add your answer
Q3. Sort the array by using all sorting algorithms, don't join
Add your answer
Q4. Subset problem find all the subsets
Ans. 
To find all subsets of a given set, use recursion to generate all possible combinations.
• Use recursion to generate all possible combinations of including or excluding each element in the set.

• Start with an empty subset and recursively add each element to create new subsets.

• Each subset can be represented as an array of strings.
Answered by AI
Add your answer
Q5. LRU Cache problem, explain it and implement it
Ans. 
LRU Cache is a data structure that stores a fixed number of items and removes the least recently used item when the cache is full.
• LRU Cache uses a combination of a doubly linked list and a hashmap to efficiently store and retrieve items.

• When an item is accessed, it is moved to the front of the linked list to indicate it is the most recently used item.

• If the cache is full, the least recently used item at the end of the ...read more
Answered by AI
Add your answer