mPHATEK Systems SQL Developer Interview Questions and Answers

Medium level coding questions on hackerrank ,1:30hr, topic- Array , DP , Matrix , Binary Search

Q1. Was Asked to Implement Hashmap and Question on OOPS and Dbms , SQL and Indexing
Add your answer

Q1. Brief Introduction
Add your answer
Q2. Rotten Oranges and basics of bfs and DFS
Add your answer

Q1. Related to front end technologies like HTML, CSS, JS
Add your answer

Q1. Basic questions on HTML, CSS, JS Focus on array questions and read methods of array before
Add your answer

Q1. Managerial round questions based on scenario to check how you think/react on the particular situation
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

It was early in the morning around 8:00AM-8:40AM. Platform used was hackerrank and the questions asked were of moderate level.

Q1. 
Split Array with Equal Sums Problem Statement
Given an array 'ARR' of size 'N', determine if there exists a triplet (i, j, k) satisfying the conditions: 0 < i , i + 1 < j , j + 1 < k and k < N...read more
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was in the evening around 4;00PM-4:20PM. This round was very interesting as it focuses more about your personality rather than your knowledge which has been already checked in previous rounds.

Round duration - 90 minutes
Round difficulty - Medium

They share doc file link which consist of 5 programming questions

Q1. 
Reverse Words in a String: Problem Statement
You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...read more
Ans. Brute force
• Create a String ans to store the reversed string.
• Initialize a variable i to 0 and iterate the whole string through a while loop.
• Skip initial spaces by just incrementing i.
• Create a String that will store the current word.
• Add the currentword and space at the beginning of ans.
• After traversing the whole string, check if the length of ans is greater than 0 then return ans after removing the last space otherwise r...read more
Answered Anonymously
Add your answer
Q2. 
Fibonacci Membership Check
Given an integer N, determine if it is a member of the Fibonacci series. Return true if the number is a member of the Fibonacci series, otherwise return false.
Fibonacci Series...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer
Q3. 
Maximum Difference Problem Statement
Given an array ARR of N elements, your task is to find the maximum difference between any two elements in ARR.
If the maximum difference is even, print EVEN; if it is...read more
Ans. Find Max And Min
We will iterate over ARR and find the MAX and MIN of the ARR. And if the MAX - MIN is odd the return “ODD” else return "EVEN". 
The algorithm will be-
1. MAX = -1, MIN= 10 ^ 9 + 1
2. For VAL in ARR.
   1. If MAX < VAL
      1. MAX = VAL
   2. If MIN > VAL
      1. MIN = VAL
3. IF (MAX-MIN) % 2
   1. Return ODD
4. ELSE
   1. Return EVEN
Space Complexity: O(1)Explanation:
O(1).
 
Since constant space is used.
Time Complexity: O(n)Explanation:
O(N), where N ...read more
Answered Anonymously
Add your answer
Q4. 
Remainder When Divided By 11 Problem Statement
Determine the remainder when a given number, 'N' in the form of a string, is divided by 11.
Input:
The first line contains an integer 'T' denoting the numb...read more
Ans. Using Modulo Property
1. Since the number is very large we can not simply calculate N % 11.
2. Now, any number say 256 % 11 can be calculated as (25*10 + 6)%11. Which in turn can be calculated as (( 25*10)%11+ 6)%11 or ( (25%11)*10 + 6)%11. Similarly 25%11 can be calculated as (2*10+5)%11. Therefore , 256 %11 can be finally calculated as ( ( (2*10 + 5)%11 )*10 + 6)%11.
3. So, the idea is to store the number N in string Str.
4. Take a ...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

In this round interviewer asked me to solve 3 programming questions.

Q1. 
Selection Sort Algorithm
Selection sort is a sorting technique that works by repeatedly finding the minimum element (considering ascending order) from the unsorted part and placing it at the beginning of ...read more
Ans. Selection Sort Approach
Selection sort is a standard sorting algorithm that uses nested loops to find all the minimum elements in the array in each iteration and swap them with the starting element of the unsorted region of the array.
 
Steps :
• Use a minValue variable to find the index of the minimum element of the array.
• Use a loop to iterate over all the elements of the array.
• Use a nested loop to find the minimum ele...read more
Answered Anonymously
Add your answer
Q2. 
String Palindrome Verification
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
Input:
The input is a single string without any leading or trailing...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer
Q3. 
Star Pattern Problem Statement
Display the star pattern for a given positive integer N.
Example:
Input:
N = 4
Output:
   *
  ***
 *****
*******
 
Explanation:
The dots in the image represent spaces. Al...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was the HR round. They asked me simple HR questions and 1 coding question.

Q1. 
Character Counting Challenge
Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...read more
Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered Anonymously
Add your answer