**Larsen & Toubro Ltd**, commonly known as **L&T**, is an Indian multinational conglomerate company, with business interests in engineering, construction, manufacturing, technology, information technology, and financial services, headquartered in Mumbai. ^{}The company is counted among the world’s top five construction companies. It was founded by Henning Holck-Larsen and Søren Kristian Toubro, who were two Danish engineers taking refuge in India.

It has got a 3.7* rating on Glassdoor and is considered one of the best product-based companies. It is highly regarded for its work-life balance.

They provide good training as well which will be beneficial in future too. You can practice the below questions collected from Larsen Toubro Interview Experience for the interview. We have collected past frequently asked questions from Larsen Toubro Interview Experience for your reference.

Categories of Questions

## Larsen & Toubro Array Questions

**Question 1. How to check if two given sets are disjoint?** The problem “How to check if two given sets are disjoint?” states that suppose you are given two sets in the form of array say set1[] and set2[]. Your task is to find out whether the two sets are Disjoint Sets or not. Example inputSet1[] = {1, 15, 8, 9, ...

**Question 2. Range sum queries without updates** Problem Statement The problem “Range sum queries without updates” states that you have an array of integers and a range. The problem statement asks to find out the sum of all the elements within the given range. Example arr[]={10, 9, 8, 7, 6} Query: {(0, 4), (1, 3)} 40 24 ...

## Larsen & Toubro String Questions

**Question 3. Pattern Occurrences using Stack** Problem Statement Given two arrays pattern[ ] and text[ ] of character type. The problem “Pattern Occurrences using Stack” asks to create a function to find the total number of occurrences of the pattern in the text while removing the found pattern from the text using the stack data structure. ...

## Larsen & Toubro Stack Questions

**Question 4. Pattern Occurrences using Stack** Problem Statement Given two arrays pattern[ ] and text[ ] of character type. The problem “Pattern Occurrences using Stack” asks to create a function to find the total number of occurrences of the pattern in the text while removing the found pattern from the text using the stack data structure. ...

**Question 5. Reversing a Queue** In Reversing a Queue problem we have given a queue, write an algorithm to reverse the queue. Examples Input queue = 10 -> 8 -> 4 -> 23 Output queue = 23->4->8->10 Input queue = 11 -> 98 -> 31 -> 42 -> 73 -> 6 Output queue = 6 ...

## Larsen & Toubro Queue Questions

**Question 6. Reversing a Queue** In Reversing a Queue problem we have given a queue, write an algorithm to reverse the queue. Examples Input queue = 10 -> 8 -> 4 -> 23 Output queue = 23->4->8->10 Input queue = 11 -> 98 -> 31 -> 42 -> 73 -> 6 Output queue = 6 ...

## Larsen & Toubro Other Questions

**Question 7. Find missing elements of a range** The problem Find missing elements of a range” states that you are given an array of distinct elements within a particular range and a range given as low and high. Find all the missing elements within a range which is not present in an array. The output should be in ...