Gif Technologies Software Developer Interview Questions and Answers

Q1. Oops question related to java
Add your answer
Q2. Project related questions
Add your answer
Q3. String based coding questions
Add your answer
Q4. Database related questions
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It was around 4 pm in the evening and it includes both MCQs and coding questions. Hackerrank platform was user friendly and good.

Q1. 
Maximum XOR Problem Statement
You are given an integer X. Your goal is to find an integer Y such that the bitwise XOR of X and Y yields the maximum possible value. The integer Y must not exceed 2305843009...read more
Ans. 
Find an integer Y such that XOR of X and Y yields maximum value within given constraints.
• Iterate through each test case and find the maximum possible Y by flipping all bits of X except the most significant bit.

• The maximum value of Y is 2^61 - 1, which is 2305843009213693951.

• Ensure that the obtained Y does not exceed the given constraints.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

30-40 minutes interview round.

Q1. 
Kth Largest Element Problem
Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.
Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...read more
Ans. 
Find the Kth largest element in an array of distinct positive integers.
• Sort the array in non-increasing order to easily find the Kth largest element.

• Ensure all elements in the array are distinct for accurate results.

• Handle multiple test cases efficiently by iterating through each case.
Answered by AI
Add your answer
Q2. How can you measure 9 minutes using only a 4-minute hourglass and a 7-minute hourglass?
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Resume based round and some technical concepts were asked

Q1. How can you find the 5th highest salary in a list of salaries using a SQL query?
Ans. 
Use SQL query with ORDER BY and LIMIT to find the 5th highest salary.
• Use ORDER BY clause to sort salaries in descending order

• Use LIMIT 4,1 to skip the first 4 salaries and get the 5th highest salary
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

Easiest of all was the HR round.

Round duration - 75 min
Round difficulty - Medium

This round was MCQ and coding round. 25 MCQs and one coding question were asked. MCQs were based on OS, DBMS, Aptitude and Data Structures.

Q1. 
Minimum Days to Complete Work
You have 'N' tasks to complete. Each task can only be done on one of two specific days provided in two arrays: day1 and day2.
For each task i, day1[i] represents the earliest...read more
Ans. 
Find the minimum number of days required to complete all tasks given specific completion days for each task.
• Sort the tasks based on day1 in ascending order.

• For each task, choose the minimum of day1 and day2 as the completion day.

• Keep track of the maximum completion day for each task.

• The final answer is the maximum completion day of all tasks.
Answered by AI
Add your answer

Round duration - 30 min
Round difficulty - Easy

This was a Data Structural round. Only one coding question was asked by the interviewer. The interviewer was very friendly. This round was very easy.

Q1. 
Bubble Sort Problem Statement
Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.
Input:
The first line contains an integer 'T' r...read more
Ans. 
Bubble Sort algorithm is used to sort an array of non-negative integers in non-decreasing order.
• Implement the Bubble Sort algorithm to sort the array in place.

• Compare adjacent elements and swap them if they are in the wrong order.

• Repeat this process until the array is sorted.

• Time complexity of Bubble Sort is O(n^2) in the worst case.

• Example: For input [6, 2, 8, 4, 10], the output should be [2, 4, 6, 8, 10].
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

It was in the evening.
It consisted of 26 questions of easy to hard level.
It consisted of 25 MCQs and only 1 coding problem.

Q1. 
Author and Books Formatting
Given a structured list of books and their authors, format the information as specified.
Input:
The first line of input contains an integer ‘T' representing the number of tes...read more
Ans. 
The task is to format a list of authors and their books in a specific way as per the given input format.
• Parse the input to extract the number of test cases, number of authors, author names, and their respective books.

• Format the output by printing the author names and their books in the specified format.

• Ensure correct sequence and labeling of authors and books as per the example provided.

• Handle multiple test cases and a...read more
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Medium

It was more of CV based round. A brief discussion on projects was there followed by some questions like why optum.

Q1. 
Delete a Node from a Linked List
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
Input:
The first line co...read more
Ans. 
Implement a function to delete a node from a linked list at a specified position.
• Traverse the linked list to find the node at the specified position.

• Update the pointers of the previous and next nodes to skip the node to be deleted.

• Handle edge cases such as deleting the head or tail of the linked list.

• Ensure to free the memory of the deleted node to avoid memory leaks.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

A short round where some basic dbms questions like procedure, cursor were asked. Then some questions on whether I would prefer working alone or in a team. Where I see myself in 5 years.

Q1. 
Graph Coloring Problem
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...read more
Ans. 
Given a graph with 'N' vertices and 'M' edges, determine if it can be colored using two colors without adjacent vertices sharing the same color.
• Use graph coloring algorithm like BFS or DFS to check if the graph can be colored with two colors without conflicts.

• Check if any adjacent vertices have the same color. If so, it is not possible to color the graph as described.

• If the graph has connected components, color each co...read more
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

Q1. 
Array Intersection Problem Statement
Given two integer arrays/ lists ARR1 and ARR2 of sizes N and M respectively, you are required to determine their intersection. An intersection is defined as the set of...read more
Ans. 
Find the intersection of two integer arrays/lists in the order they appear in the first array/list.
• Iterate through the elements of the first array/list and check if they exist in the second array/list.

• Use a hash set to store elements of the first array/list for efficient lookups.

• Print the common elements in the order they appear in the first array/list.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Q1. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...read more
Ans. 
Find the longest palindromic substring in a given string.
• Iterate through the string and expand around each character to find palindromes

• Keep track of the longest palindrome found so far

• Return the longest palindromic substring
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Q1. Find next max element
Ans. 
Find the next maximum element in an array of strings.
• Iterate through the array and keep track of the current maximum element.

• Compare each element with the current maximum and update if a larger element is found.

• Return the next maximum element after the current maximum.
Answered by AI
Add your answer
Q2. 2 data structure question
Add your answer
Q3. Reverse linkedlist
Add your answer

Round duration - 180 minutes
Round difficulty - Medium

There were total 4 coding questions
1 -> Backtracking
2 -> Recursion
3 -> Greedy
4- > Graphs

Q1. 
Print All Paths Problem Statement
In this problem, you are provided with a graph consisting of 'N' nodes and 'M' unidirectional edges. Additionally, two integers 'S' and 'D' are given, representing the so...read more
Ans. 
The task is to find all unique paths from a source node to a destination node in a graph.
• Identify all unique paths from source node to destination node in a graph

• Ensure all nodes in the path are unique

• Output total number of valid paths and list nodes in each path in lexicographical order
Answered by AI
Add your answer
Q2. 
Maximum Meetings Problem Statement
Given the schedule of N meetings with their start time Start[i] and end time End[i], you need to determine which meetings can be organized in a single meeting room such ...read more
Ans. 
Given N meetings with start and end times, find the maximum number of meetings that can be organized in a single room without overlap.
• Sort the meetings based on their end times.

• Iterate through the sorted meetings and select the next meeting that does not overlap with the current meeting.

• Keep track of the selected meetings and return their indices in the order they are organized.
Answered by AI
Add your answer
Q3. 
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight 'W' in their knapsack. The store contains 'N' items, each with a known weight and value. Given these constr...read more
Ans. 
The 0/1 Knapsack Problem involves maximizing profit by selecting items with known weights and values to fit within a knapsack of limited capacity.
• Create a 2D array to store the maximum profit that can be achieved for each item and weight combination.

• Use dynamic programming to iteratively fill the knapsack with items, considering whether to include each item or not.

• The final value in the 2D array will represent the maxi...read more
Answered by AI
Add your answer
Q4. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
Count the number of islands in a 2D matrix of 1s and 0s.
• Use depth-first search (DFS) to traverse the matrix and identify connected groups of 1s.

• Maintain a visited array to keep track of visited cells to avoid redundant traversal.

• Increment the island count each time a new island is encountered.

• Consider all eight possible directions for connectivity while traversing the matrix.

• Handle edge cases such as out of bounds indi
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

there were total 2 coding questions asked
one was from 2 pointer and another was from Binary Tree

Q1. 
Rearrange Array: Move Negative Numbers to the Beginning
Given an array ARR consisting of N integers, rearrange the elements such that all negative numbers are located before all positive numbers. The orde...read more
Ans. 
Yes, this can be achieved by using the two-pointer approach to rearrange the array in-place with O(1) auxiliary space.
• Use two pointers, one starting from the beginning and one from the end of the array.

• Swap elements at the two pointers if they are not in the correct order (negative before positive).

• Continue this process until the two pointers meet in the middle of the array.
Answered by AI
Add your answer
Q2. 
Maximum Path Sum Between Two Leaves
Given a non-empty binary tree where each node has a non-negative integer value, determine the maximum possible sum of the path between any two leaves of the given tree.
...read more
Ans. 
Find the maximum path sum between two leaf nodes in a binary tree.
• Traverse the tree to find the maximum path sum between two leaf nodes

• Keep track of the maximum sum as you traverse the tree

• Consider all possible paths that pass through the root and those that do not

• Handle cases where there is only one leaf node in the tree
Answered by AI
Add your answer