Skip to content

LTTS Online Assessment

Overview

The LTTS online assessment (OA) is the first round of fresher hiring, and clearing it shortlists you for interviews, not an offer. Format (candidate-reported): aptitude + domain + 1-2 coding (CoCubes in some campus reports). Full process: Online Test → Technical → HR. Eligibility: often 60% or 6.5-6.75 CGPA throughout; no active backlogs.

Here is how public prep guides and student write-ups describe the LTTS online assessment. This is not an official company brochure.

Engineering R&D services hiring - role-specific technical depth.

Usual selection rounds

Rounds students usually mention: Online / written technical+aptitude → Technical interview → HR

Item From student reports
Platform Varies by drive
Online test summary LTTS (engineering services) ≠ LTFS (NBFC). Do not copy LTFS Digitization GET experiences onto LTTS blindly. Confirm LTTS pattern from your college placement email.
Eligibility notes Drive-specific - confirm notification
Branches (reported) Confirm notification

Online test sections

Section-level detail not verified in our source set yet - use the placement email / official PDF.

Extra notes from sources

  • Public fresher sectional counts are sparse; check your college placement email or official notification for exact section counts.

Sample practice question styles

These are practice questions for speed - not claimed to be from a real LTTS live paper.

Coding Q1: Top K frequent elements

Problem: Given an integer array and an integer k, return the k most frequent elements. Order among equals can be arbitrary unless the problem says otherwise.

Approach: Count frequencies with a hash map, then use a heap of size k (or bucket sort by frequency) to extract the top k keys.

Complexity: O(n log k) with a heap

LTTS tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q2: Linked list cycle

Problem: Given the head of a linked list, return true if there is a cycle and false otherwise.

Approach: Floyd’s tortoise and hare: move one pointer one step and another two steps. If they meet, a cycle exists. If the fast pointer hits null, there is no cycle.

Complexity: O(n) time, O(1) space

LTTS tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q3: Binary tree level order

Problem: Given the root of a binary tree, return the level-order traversal (breadth-first) as a list of levels.

Approach: Use a queue. For each level, drain the current queue size, collect values, and enqueue children for the next level.

Complexity: O(n) time, O(n) space

LTTS tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q4: Coin change (min coins)

Problem: Given coin denominations and an amount, return the fewest coins needed to make that amount, or -1 if it is impossible.

Approach: Unbounded knapsack DP: let dp[x] be the minimum coins for amount x. For each coin, update dp[c..amount]. Initialize dp[0] = 0 and the rest to a large sentinel.

Complexity: O(amount × coins)

LTTS tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Prep tips from those student reports

  1. Match prep to exact L&T entity on the JD
  2. Core engineering + aptitude

Sources

These notes come from public reports and can differ by campus, year, and role. If your college placement email or the official careers/notification PDF says something different, follow that.

Comments & Suggestions

Similar companies

L&T · Persistent Systems · Bosch · Siemens · Birlasoft