Link Group Software Developer Interview Questions and Answers for Experienced

Round duration - 30 minutes
Round difficulty - Easy

It was in the day time. I was asked the programming language of my choice. It was mostly focused on programming fundamentals. I was asked 2 questions based on Data Structures and Algorithms.

Q1. How can you detect a loop in a linked list?
Ans. 
A loop in a linked list can be detected using Floyd's Cycle Detection Algorithm.
• Use two pointers - slow and fast, where slow moves one step at a time and fast moves two steps at a time.

• If there is a loop, the two pointers will eventually meet at some point within the loop.

• To detect the start of the loop, reset one pointer to the head and move both pointers one step at a time until they meet again.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This round was mostly focused on my resume and projects.

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening. I went to their office in Gurgaon. It was taken by one of the technology director who had a lot of experience. 
 

Round duration - 60 Minutes
Round difficulty - Hard

HackerRank code pair feature was used.
A coding question related to Dynamic Programming was asked. Followed by questions on data structures, graph theory, etc.
The interviewer was very nice and seemed to be interested in listening to my approaches.

Q1. 
Minimum Number of Taps to Water the Garden
Given a garden that extends along a one-dimensional x-axis from point 0 to point N, your task is to determine the minimum number of taps needed to water the enti...read more
Ans. 
Find the minimum number of taps needed to water the entire garden using given tap ranges.
• Iterate over each tap and find the maximum range it can cover.

• Sort the taps based on their starting points and their maximum coverage ranges.

• Use a greedy approach to select the next tap that covers the maximum uncovered area.

• Keep track of the covered area and the number of taps used.

• Return the minimum number of taps required to wat
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

coding questions were asked. Difficulty level Medium.
SQL query, DBMS concepts, OOP concepts, CN concepts.
One question related to BST.

Q1. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
• Use Floyd's Tortoise and Hare algorithm to detect a cycle in O(N) time complexity and O(1) space complexity.

• Initialize two pointers, slow and fast, and move them at different speeds through the list.

• If there is a cycle, the fast pointer will eventually meet the slow pointer.

• If the fast pointer reaches the end of the...read more
Answered by AI
Add your answer
Q2. 
Palindromic Substrings Problem Statement
You are given a string 'STR'. Your task is to determine the total number of palindromic substrings present in 'STR'.
Example:
Input:
"abbc"
Output:
5
Explana...read more
Ans. 
Count the total number of palindromic substrings in a given string.
• Iterate through each character in the string and expand around it to find palindromic substrings.

• Use dynamic programming to optimize the solution by storing previously calculated palindromic substrings.

• Consider both odd and even length palindromes while counting.

• Example: For input 'abbc', the palindromic substrings are ['a', 'b', 'b', 'c', 'bb'], totali
Answered by AI
Add your answer

Q1. Project Architecture
Add your answer

Q1. Informatica tech questions
Add your answer