Upload Button Icon Add office photos

Filter interviews by

Linedata Network & System Administrator Interview Questions and Answers

Updated 4 Jul 2022

Linedata Network & System Administrator Interview Experiences

1 interview found

I applied via Naukri.com

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - HR 

(2 Questions)

  • Q1. HR asked about normal self intro
  • Q2. Asked about previous experience

Interview Preparation Tips

Interview preparation tips for other job seekers - Just enjoy the process because all these IT company procedure will take weeks between each round... Give or take from 1st day of applying to last offer letter will take around 1 month. Just prepare according to your role. Dont even get nervous at point because you need that and important thing is they need to recruit you also so dont be afraid to attend as many interviews it takes to get a job. Because we spent years of studying but everything will come to end only if you get a job so just try hard for 2 or 3 months time is nothing compared to our journey in studies. So dont complain about company and sit simply just try till to land on a job.
All the best
Thank you

Interview questions from similar companies

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

2 coding questions and 20 mcq
 

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process.

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain.

    • Handle edge cases like no fresh oranges or all oranges already rotten.

    • Consider using a queue to efficiently process adjacent oranges.

    • Ensure to update the grid with the new state of oranges after each second.

  • Answered by AI
  • Q2. 

    Calculate Sum of Proper Divisors

    Given a natural number N, return the sum of all its proper divisors.

    A proper divisor of Y is defined as a number X such that X < Y and Y % X = 0.

    Example:

    Input:
    T...
  • Ans. 

    Calculate the sum of proper divisors of a given natural number.

    • Iterate from 1 to sqrt(N) and check for divisors

    • If a divisor is found, add it to the sum and also add N/divisor if it is not the same as divisor

    • Return the sum as the result

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

Technical interview

  • Q1. 

    Rearrange Array to Form Largest Number

    Given an array ARR consisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed.

    ...

  • Ans. 

    Rearrange the array elements to form the largest possible number by concatenating them.

    • Sort the array elements in a custom comparator function to get the largest number.

    • Convert the sorted array elements to strings and concatenate them to form the final number.

    • Handle cases where the numbers have the same prefix by comparing the concatenated forms.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in DelhiEligibility criteriaCriteria not revealed to candidateAmazon interview preparation:Topics to prepare for the interview - Array, Linkedlist, Tree, Graph, Stack, OOPS, Geeksforgeeks archives, coding ninjas interview experience blogsTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Be clear about whatever you have mentioned in resume, don't mention buzz words, because interviewer can go in depth
Tip 2 : Along with DS and Algo, if you have 3-4 months experience or internship experience, then be ready to answer scenario based technical questions like scaling the application that you developed and design concepts that can be used for improving
Tip 3 : Last but most important tip is to be calm through out the whole process ,don't loose hope if any round didn't go well ,if you have explained your thought process there is still chance to procees to next round so keep preparating for next rounds.

Application resume tips for other job seekers

Tip 1 : Keep it one page resume and mention keywords which align with your technical and personal competencies.
Tip 2 : Mention 3-4 projects in the order that , project which you can explain best should be at top,then the next, and so on.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Miinutes
Round difficulty - Medium

First round had MCQ + 2 coding questions. It was held in morning around 11 am. It was held on campus.

  • Q1. 

    Robot Delivery Path Problem

    You are tasked with directing a robot from the top-left corner of an N*N matrix to a specified point (x, y), delivering a parcel. The robot is restricted to move only on flat a...

  • Ans. 

    Determine if a robot can reach a specified destination in a matrix by moving only downwards or rightwards.

    • Start at (0,0) and move towards the destination (x, y) only downwards or rightwards.

    • Check if the path is clear (1) and avoid obstacles (0) while staying within matrix boundaries.

    • Return true if the robot can reach the destination, false otherwise.

    • Example: For input matrix [[1, 0, 1], [1, 1, 1], [1, 1, 5]] with desti

  • Answered by AI
  • Q2. 

    Unique Element in Array

    Given an arbitrary array arr consisting of N non-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl...

  • Ans. 

    Find the unique element in an array where every element appears thrice except for one.

    • Use XOR operation to find the unique element.

    • Iterate through the array and XOR each element to find the unique element.

    • The XOR operation cancels out elements that appear thrice, leaving only the unique element.

    • Example: arr = [2, 2, 3, 2], XOR of all elements = 3.

    • Example: arr = [0, 1, 0, 1, 0, 1, 99], XOR of all elements = 99.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

Second Round was held in morning around 10-11 am. There was one interviewer working on his laptop. Interviewer was really helpful and first offered me water and then for a bit talked about himself.

  • Q1. 

    BST Iterator Problem Statement

    You are tasked with implementing a class BSTIterator, which is designed to traverse a Binary Search Tree (BST) in the inorder manner. The class must support the following op...

  • Ans. 

    Implement a BSTIterator class to traverse a Binary Search Tree in inorder manner.

    • Implement a constructor to initialize the iterator with the root of the BST.

    • Implement next() and hasNext() methods to traverse the BST in inorder.

    • Implement prev() and hasPrev() methods to access the previous element in the inorder traversal.

    • Use level-order traversal format to represent the tree input.

    • Output the inorder traversal of the bin

  • Answered by AI
  • Q2. 

    Distance Between Two Nodes in a Binary Tree

    Given a binary tree and the values of two distinct nodes, determine the distance between these two nodes in the tree. The distance is defined as the minimum num...

  • Ans. 

    Calculate the distance between two nodes in a binary tree.

    • Traverse the tree to find the paths from the root to each node

    • Find the lowest common ancestor of the two nodes

    • Calculate the distance by adding the distances from the LCA to each node

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Dr. B.R. Ambedkar National Institute of Technology. I applied for the job as SDE - 1 in HyderabadEligibility criteriaNo criteriaAmazon interview preparation:Topics to prepare for the interview - Array,Linked List, Trees, Dynamic Programming, Graphs, Math, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Keep talking about what are you thinking
Tip 2 : Don't beat about the bush if don't know the answer just say so
 

Application resume tips for other job seekers

Tip 1 : Only show projects you are confident about
Tip 2 : Basic Web and android projects are also fine

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 150 minutes
Round difficulty - Medium

We could attempt at any time out of the 3 given days.
The round was very time constrained and we could NOT go back to the question that we already attempted.

  • Q1. 

    Merge Two Sorted Linked Lists

    Given two sorted linked lists, your task is to merge them into a single sorted linked list. Return the head of the newly combined list.

    Note:

    The given linked lists may or ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list.

    • Create a dummy node to start the merged list

    • Compare nodes from both lists and add the smaller one to the merged list

    • Move the pointer of the merged list and the list with the smaller node

    • Handle cases where one list is exhausted before the other

    • Return the head of the merged list

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Hard

Evening at 5:00 pm. It was held on Amazon Chime app
Face cam was to be kept on COMPULSARILY. You could however not see the interviewer.
Codepen type environment was also used for typing my code which could be edited by the interviewer also.
(Shared document kind of)
Interviewer was very professional and was trying to push me towards getting the most optimal solution. Each and every answer was asked a counter question as to why I made that choice

  • Q1. 

    Missing Numbers Problem Statement

    You are provided with an array called ARR, consisting of distinct positive integers. Your task is to identify all the numbers that fall within the range of the smallest a...

  • Ans. 

    Identify missing numbers within the range of smallest and largest elements in an array.

    • Find the smallest and largest elements in the array.

    • Generate a list of numbers within the range of smallest and largest elements.

    • Remove the numbers that are present in the array to get the missing numbers.

    • Sort and return the missing numbers.

  • Answered by AI
  • Q2. 

    Find Maximum Element Between Two Nodes in a BST

    Given a Binary Search Tree (BST) and two integers, NODE1 and NODE2, determine the maximum element found in the path between NODE1 and NODE2.

    Explanation:

    ...

  • Ans. 

    Find the maximum element between two nodes in a Binary Search Tree (BST) path.

    • Traverse the BST to find the path between NODE1 and NODE2.

    • Keep track of the maximum element encountered in the path.

    • Return the maximum element found, or -1 if NODE1 or NODE2 are not in the BST or no elements exist between them.

  • Answered by AI
  • Q3. 

    String Compression Problem Statement

    Implement a program that performs basic string compression. When a character is consecutively repeated more than once, replace the consecutive duplicates with the coun...

  • Ans. 

    Implement a program to compress a string by replacing consecutive duplicates with the count of repetitions.

    • Iterate through the string and keep track of consecutive characters and their counts.

    • Replace consecutive duplicates with the count of repetitions.

    • Ensure the count of repetitions is ≤ 9.

    • Return the compressed string.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Veermata Jijabai Technological Institute. I applied for the job as SDE - 1 in BangaloreEligibility criteriaOnly femalesAmazon interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DBMS, Dynamic programming, Computer network basicsTime required to prepare for the interview - 1.5 monthsInterview preparation tips for other job seekers

Tip 1 : Be very very clear with your basics.
Tip 2 : Think well before giving an answer
Tip 3 : Practice, practice, practice DS Algo questions

Application resume tips for other job seekers

Tip 1 : Limit it to 1 page ONLY.
Tip 2 : Be ready to face all kinds of questions on topics you have mentioned in the resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. 

    Count Inversions Problem Statement

    Given an integer array ARR of size N, your task is to find the total number of inversions that exist in the array.

    An inversion is defined for a pair of integers in the...

  • Ans. 

    Count the total number of inversions in an integer array.

    • Iterate through the array and for each pair of elements, check if the conditions for inversion are met.

    • Use a nested loop to compare each element with all elements to its right.

    • Keep a count of the inversions found and return the total count at the end.

  • Answered by AI
  • Q2. 

    Postfix Expression Evaluation Problem Statement

    Given a postfix expression, your task is to evaluate the expression. The operator will appear in the expression after the operands. The output for each expr...

  • Ans. 

    Evaluate postfix expressions by applying operators after operands. Return result modulo (10^9+7).

    • Iterate through each character in the postfix expression

    • If character is an operand, push it onto the stack

    • If character is an operator, pop two operands from stack, apply operator, and push result back

    • Continue until end of expression, return final result modulo (10^9+7)

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Medium

  • Q1. 

    String Rearrangement Problem Statement

    You are given a string of lowercase characters. The objective is to rearrange (reorder) the string so that no two adjacent characters are identical.

    Return the rear...

  • Ans. 

    Given a string of lowercase characters, rearrange it so that no two adjacent characters are identical. Return the rearranged string or 'NO SOLUTION'.

    • Iterate through the string and count the frequency of each character.

    • Sort the characters based on their frequency in non-increasing order.

    • Place the characters with highest frequency first, alternating with other characters.

    • If there are more than half of the characters with

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    Given an integer array ARR of size N and an integer S, your task is to return a list of all pairs of elements such that the sum of each pair equals S.

    Input:

    The first line co...
  • Ans. 

    The task is to find pairs of elements in an array that sum up to a given target value.

    • Iterate through the array and for each element, check if the complement (target - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Ensure pairs are sorted based on the criteria mentioned in the question.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Medium

  • Q1. 

    Find Number of Islands

    You are provided with a 2-dimensional array/list of size N rows by M columns, containing ones (1) and zeroes (0). Here, 1 represents land, and 0 represents water.

    A cell is consider...

  • Ans. 

    Find the number of islands in a 2D matrix of 1s and 0s.

    • Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.

    • Use a visited array to keep track of visited cells to avoid counting the same island multiple times.

    • Increment the island count whenever a new island is encountered.

  • Answered by AI
  • Q2. 

    Triplets in a Sorted Doubly Linked List

    Given a sorted doubly linked list of distinct nodes, determine how many triplets in the list have a sum equal to a given value 'X'. Each node in the list contains a...

  • Ans. 

    Given a sorted doubly linked list of distinct nodes, find and count triplets with a sum equal to a given value 'X'.

    • Iterate through the list and for each node, use two pointers to find the other two nodes that sum up to 'X'.

    • Keep track of the count of triplets found and return it at the end.

    • Handle edge cases like when the list has less than 3 nodes or no triplets are found.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from J.C. Bose University of Science and Technology, YMCA. Eligibility criteriaCgpa above 7Amazon interview preparation:Topics to prepare for the interview - Array, Strings, Graph, Linked list, DP, Greedy, Trees, Binary search, Two-pointersTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Prepare application part of topics like graph other than the general questions.
Tip 2 : Prefer Leetcode for solving questions.
Tip 3 : Practice as many questions as possible from topic arrays.

Application resume tips for other job seekers

Tip 1 : Add stuff you really have good knowledge about.
Tip 2 : Use the point-wise format for filling any area (eg: Brief explanation of projects).

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

In this round i was tested for Data Structure competency. Two questions were asked.

  • Q1. 

    Group Anagrams Problem Statement

    Given an array or list of strings called inputStr, your task is to return the strings grouped as anagrams. Each group should contain strings that are anagrams of one anoth...

  • Ans. 

    Group anagrams in an array of strings based on their characters.

    • Iterate through the array of strings and sort each string to group anagrams together.

    • Use a hashmap to store the sorted string as key and the list of anagrams as value.

    • Return the values of the hashmap as the grouped anagrams.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Two questions were asked in this round on data structures and algorithms.

  • Q1. 

    BST Iterator Problem Statement

    You are tasked with creating a class named BSTIterator that acts as an iterator for the inorder traversal of a binary search tree. Implement the following functions:

    1. BST...
  • Ans. 

    Implement a BSTIterator class for inorder traversal of a binary search tree.

    • Create a BSTIterator class with constructor, next, and hasNext functions.

    • Use a stack to simulate inorder traversal of the binary search tree.

    • Ensure the hasNext function returns true if there are more elements to traverse.

    • Example: Input - 4 2 6 1 3 5 7 -1 -1 -1 -1 -1 -1, Output - 1 2 3 4 5 6 7

  • Answered by AI
  • Q2. 

    K Most Frequent Words Problem Statement

    Given an array or list WORDS of 'N' non-empty words and an integer 'K', identify the 'K' most frequent words and return them sorted by their frequency, in descendin...

  • Ans. 

    Identify the K most frequent words in a list, sorted by frequency and lexicographical order.

    • Use a hashmap to store word frequencies

    • Use a min heap to keep track of K most frequent words

    • Sort the heap based on frequency and lexicographical order

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Dr. B.R. Ambedkar National Institute of Technology. I applied for the job as SDE - 1 in HyderabadEligibility criteria7 CGPAAmazon interview preparation:Topics to prepare for the interview - Data Structures, Dynamic Programming , Trees, LinkedList, OOPS, Stack, QueueTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : Build strong fundamentals in Data Structures and Algorithms. Practise basic data structures like Arrays, Linked List, Tree, Stack, Queues. For Graphs practise - BFS, DFS, Kruskal, Prims.
Tip 2 : Practice coding questions (medium-hard level) on online platforms like CodeZen, Codeforces, CodeChef.
Tip 3 : Practice mock interviews before the real interview.

Application resume tips for other job seekers

Tip 1 : Briefly write you skills in which you are comfortable. Don't try to add anything vague as you will be questioned about everything which is written on resume.
Tip 2 : Have at least two projects on your resume which reflects application of your acquired skills

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

Round duration - 60 minutes
Round difficulty - Easy

Round 2 - Face to Face 

Round duration - 50 minutes
Round difficulty - Easy

Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round 4 - Face to Face 

Round duration - 40 minutes
Round difficulty - Easy

 

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

  • Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
  • Ans. 

    Implement a Trie data structure with insert and search functions.

    • Create a TrieNode class with children and isEndOfWord attributes.

    • Implement insert function to add words by iterating through characters.

    • Implement search function to check if a word exists by traversing the Trie.

    • Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteria 7 CGPA Amazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating System, Database Management System, Object-Oriented Programming SystemTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Do lot of hard work and practice of  Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.

Application resume tips for other job seekers

Make your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. 

    String Transformation Problem Statement

    Given a string str of length N, perform a series of operations to create a new string:

    1. Select the smallest character from the first 'K' characters of the string,...
  • Ans. 

    The problem involves selecting the smallest character from the first 'K' characters of a string and appending it to a new string until the original string is empty.

    • Iterate through the string, selecting the smallest character from the first 'K' characters each time.

    • Remove the selected character from the original string and append it to the new string.

    • If fewer than 'K' characters remain, sort and append them in order.

    • Rep...

  • Answered by AI
  • Q2. 

    Counting Derangements Problem

    A derangement is a permutation of 'N' elements, where no element appears in its original position. For instance, a derangement of {0, 1, 2, 3} is {2, 3, 1, 0} because each el...

  • Ans. 

    Count the total number of derangements possible for a set of 'N' elements.

    • A derangement is a permutation where no element appears in its original position.

    • Use the formula for derangements: !n = n! * (1 - 1/1! + 1/2! - 1/3! + ... + (-1)^n/n!).

    • Return the answer modulo (10^9 + 7) as the result could be very large.

  • Answered by AI
Round 2 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

1 hour online interview. 
Slot was given prior via email.
The HR contacted me via email and simultaneously provided me a link where I had to write the codes during my interview

  • Q1. 

    Mike and Mobile Keypad Problem

    Mike, a young math enthusiast, is playing with his mom’s mobile phone, which has a keypad with 12 buttons (10 digits: 0-9, and 2 special characters: ‘*’ and ‘#’). His challe...

  • Ans. 

    Calculate the number of distinct numbers that can be formed by pressing 'N' buttons on a mobile keypad following specific rules.

    • Use dynamic programming to keep track of the number of distinct numbers that can be formed at each step.

    • Consider the possible transitions from each button to calculate the total number of distinct numbers.

    • Implement a solution that efficiently handles large values by using modulo arithmetic.

    • Ens...

  • Answered by AI
  • Q2. 

    Maximum Subarray Sum Problem Statement

    Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.

    Example:

    Input:
    array = [34, -50, 42, 14, -5, 86]
    Out...
  • Ans. 

    Find the maximum sum of any contiguous subarray within an array of integers.

    • Iterate through the array and keep track of the maximum sum of subarrays encountered so far.

    • At each index, decide whether to include the current element in the subarray or start a new subarray.

    • Use Kadane's algorithm to efficiently find the maximum subarray sum in O(N) time complexity.

  • Answered by AI
  • Q3. 

    Maximum Sum of Non-Adjacent Elements

    Given an array/list of ‘N’ integers, your task is to return the maximum sum of the subsequence where no two elements are adjacent in the given array/list.

    Example:

    I...
  • Ans. 

    Find the maximum sum of non-adjacent elements in an array.

    • Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or skip it.

    • At each index, the maximum sum is either the sum of the current element and the element two positions back, or the sum at the previous index.

    • Iterate through the array and update the maximum sum at each index accordingly.

    • Return the...

  • Answered by AI
  • Q4. 

    Trapping Rainwater Problem Statement

    You are given an array ARR of long type, which represents an elevation map where ARR[i] denotes the elevation of the ith bar. Calculate the total amount of rainwater t...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped within given elevation map.

    • Iterate through the array to find the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped above each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water above each bar to get the total trapped water for the elevation map.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Strongly Connected Components (Tarjan’s Algorithm) Problem Statement

    Given an unweighted directed graph with V vertices and E edges, your task is to identify and print all the strongly connected component...

  • Ans. 

    Tarjan's Algorithm is used to find strongly connected components in an unweighted directed graph.

    • Tarjan's Algorithm is a depth-first search based algorithm.

    • It uses a stack to keep track of vertices in the current SCC.

    • The algorithm assigns a unique id to each vertex and keeps track of the lowest id reachable from the current vertex.

    • Once a SCC is identified, the vertices in the stack form that SCC.

    • The algorithm runs in O...

  • Answered by AI
  • Q2. 

    Stock Trading Maximum Profit Problem

    Given the stock prices for 'N' days, your goal is to determine the maximum profit that can be achieved. You can buy and sell the stocks any number of times but can onl...

  • Ans. 

    The goal is to determine the maximum profit that can be achieved by buying and selling stocks on different days.

    • Iterate through the stock prices and buy on days when the price is lower than the next day, and sell on days when the price is higher than the next day.

    • Calculate the profit by summing up the differences between buying and selling prices.

    • Repeat the process for each test case and output the maximum profit achie...

  • Answered by AI
Round 4 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a one hour round in which I was first told to introduce myself and then moved to questions.

  • Q1. 

    Permutation in String Problem Statement

    Determine if the string str2 contains a permutation of the string str1 as one of its substrings.

    Input:

    The first line contains an integer 'T', representing the n...
  • Ans. 

    Check if a permutation of one string is a substring of another string.

    • Create a frequency map of characters in str1.

    • Iterate through str2 with a window of size N and check if the frequency map matches.

    • Return 'Yes' if a permutation is found, 'No' otherwise.

  • Answered by AI
  • Q2. 

    Sort 0s, 1s, and 2s Problem Statement

    You are provided with an integer array/list ARR of size 'N' which consists solely of 0s, 1s, and 2s. Your task is to write a solution to sort this array/list.

    Input:

    ...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time with a single scan approach.

    • Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.

    • Iterate through the array once and swap elements based on their values and the pointers.

    • After the single scan, the array will be sorted in the required order.

  • Answered by AI
Round 5 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

This was based more on my communication skills rather than my technical skills. The interviewer didn't only focus on whether I knew the answer or not but if I was able to communicate my knowledge to the interviewer.

It was more of theory based interview
Questions are as follows:-
1. What are SQL and acid properties?

2. How does a website start?

3. What are deadlocks with real life examples? Give necessary conditions for deadlock. 
-> Real life examples were must. 

4. What is virtual function?

5. Tell me the most challenging this while you made your project. ( I had to pick my project on my own) 

6. Tell me the most interesting feature you found working on a language. 

7. Technical question on structures in C as I used it in my project. The interviewer asked if the structure for a linked list is changed as:-
struct node

{
int data;
struct next; 
};
I explained how this won't work as struct will be created again and again which will lead to memory limit exceeded.

  • Q1. 

    Delete Alternate Nodes from a Singly Linked List

    Given a Singly Linked List of integers, remove all the alternate nodes from the list.

    Input:

    The first and the only line of input will contain the elemen...
  • Ans. 

    Remove alternate nodes from a singly linked list of integers.

    • Traverse the linked list and skip every alternate node while updating the next pointers.

    • Make sure to handle cases where there are less than 3 nodes in the list.

    • Update the next pointers accordingly to remove alternate nodes.

    • Example: Input: 10 20 30 40 50 60 -1, Output: 10 30 50

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from J.C. Bose University of Science and Technology, YMCA. Eligibility criteriaNo backlogsAmazon interview preparation:Topics to prepare for the interview - Dynamic programming, Algorithms, OOPS, Data Structures, Operating SystemTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Listen carefully to what the interviewer expects from you. 
Tip 2 : Practice at least 300 questions, topic wise.
Tip 3 : Do participate in contests.

Application resume tips for other job seekers

Tip 1 : Be true on your resume.
Tip 2 : Make your resume crisp and clear.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

Four parts were there in the Amcat Test. 
The first part was the code debugging round.
The second part consisted of two medium difficulty level problems.
The third part was based on Amazon LP.
The fourth part consisted of basic aptitude questions.

  • Q1. 

    Find Row K Problem Explanation

    You are given a square binary matrix mat[n][n]. The task is to determine an integer 'K' such that:

    • All elements in the Kth row are 0.
    • All elements in the Kth column are 1...
  • Ans. 

    Find the row and column in a binary matrix where all elements in the row are 0 and all elements in the column are 1.

    • Iterate through each row and column to check for the conditions mentioned in the problem statement.

    • If a row has all 0s and the corresponding column has all 1s, return the index of that row/column.

    • If no such row/column exists, return -1.

  • Answered by AI
  • Q2. 

    Clone Linked List with Random Pointer Problem Statement

    Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...

  • Ans. 

    Deep copy a linked list with random pointers and return its head.

    • Create a deep copy of the linked list by creating new nodes rather than copying references.

    • Ensure the random pointers are correctly pointing to the corresponding nodes in the cloned list.

    • Implement the function to clone the linked list and return its head.

    • Consider the constraints and input format provided in the problem statement.

    • Explore if the cloning can

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

This interview consisted of 2 technical problems and some behavioral questions. This interview was taken by an SDE-3.

  • Q1. 

    Stream of Characters Problem Statement

    You are provided with a list, DICTIONARY[], which contains a collection of words, along with a stream of characters (queries). The task is to implement a class Chara...

  • Ans. 

    Implement a class to check if a string formed by the last queried characters exists in a dictionary of words.

    • Use a trie data structure to efficiently store and search for words in the dictionary.

    • When solving a query, traverse the trie starting from the most recently queried character.

    • Return true if a valid word is found in the trie, otherwise return false.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This round consisted of some behavioral questions and 2 technical problems. This round was conducted by and SDE-2.

  • Q1. 

    Reverse Doubly Linked List Nodes in Groups

    You are given a doubly linked list of integers along with a positive integer K that represents the group size. Your task is to modify the linked list by reversin...

  • Ans. 

    Reverse groups of K nodes in a doubly linked list

    • Iterate through the linked list in groups of K nodes

    • Reverse each group of K nodes

    • Handle the case where the number of nodes left is less than K

  • Answered by AI
  • Q2. 

    Maximum Subtree Sum Problem Statement

    Given an arbitrary binary tree consisting of N nodes, your task is to find the largest subtree sum.

    Input:

    First line of each input has a single integer T, denoting...
  • Ans. 

    Find the largest subtree sum in an arbitrary binary tree.

    • Traverse the binary tree to calculate the subtree sum of each node.

    • Keep track of the maximum subtree sum encountered so far.

    • Recursively calculate the subtree sum for each node by considering its left and right children.

    • Consider edge cases like when the tree is empty or has only one node.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Lovely Professional University. I applied for the job as SDE - 1 in ChennaiEligibility criteria7 CGPAAmazon interview preparation:Topics to prepare for the interview - Data Structures & Algorithms, Operating Systems, Amazon Services, OOPS, Dynamic Programming, Space & Time Complexity, Database Management Systems, and Machine LearningTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1: The key thing that played a major role in getting the internship was practicing problems daily on various coding platforms. One should prioritize solving Medium & Hard difficulty level problems.
Tip 2: Try to get really good at hierarchical Data Structures (Graphs, Trees) & various algorithms based on them, as they are commonly asked in big tech companies. 
Tip 3: Should have at least 2 projects and it would be a plus if that project has some application in real life, but it's not necessary. And the biggest tip for getting placed into Amazon would be - 'Be familiar with Amazon Leadership Principle'. There are 14 Amazon LP in total and they can be found easily online.

Application resume tips for other job seekers

Tip 1: Do not lie about anything on your resume
Tip 2: Just keep it clean and elegant, E.g. as it would not make an impact if you won some competition at the school level (It would just consume the precious space)
Tip 3: Mention the projects that you have worked on along with the tools & technologies

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Company Website and was interviewed in May 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Coding questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be thorough with the concepts of coding, data structures and algorithms. Focus on topics like trees, linked list, arrays.

Linedata Interview FAQs

How many rounds are there in Linedata Network & System Administrator interview?
Linedata interview process usually has 2 rounds. The most common rounds in the Linedata interview process are Resume Shortlist and HR.

Tell us how to improve this page.

Interview Questions from Similar Companies

Amazon Interview Questions
4.0
 • 5.1k Interviews
Uber Interview Questions
4.2
 • 149 Interviews
Expedia Group Interview Questions
3.8
 • 75 Interviews
LinkedIn Interview Questions
4.3
 • 65 Interviews
OLX Interview Questions
3.8
 • 57 Interviews
Facebook Interview Questions
4.3
 • 52 Interviews
Groupon Interview Questions
3.1
 • 42 Interviews
Uplers Interview Questions
4.0
 • 41 Interviews
Fareportal Interview Questions
3.3
 • 30 Interviews
Yahoo Interview Questions
4.6
 • 29 Interviews
View all
Senior Analyst
94 salaries
unlock blur

₹4.8 L/yr - ₹11.2 L/yr

Team Lead
65 salaries
unlock blur

₹7 L/yr - ₹18 L/yr

Analyst
53 salaries
unlock blur

₹3 L/yr - ₹7.9 L/yr

Operations Analyst
38 salaries
unlock blur

₹3 L/yr - ₹6 L/yr

Manager
27 salaries
unlock blur

₹10.5 L/yr - ₹28 L/yr

Explore more salaries
Compare Linedata with

Amazon

4.0
Compare

Uber

4.2
Compare

Fareportal

3.3
Compare

OLX

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview