Jobra
🐞Step 1 of Jobra:AI Debugging Rounds
DSA+AIPreparing you for both.
JOBRA · AI DEBUG ROUND (PREVIEW)sum.cpp
// buggy snippet
int total(vector<int>& a, int n) {
    int sum = 0;
    for (int i = 0; i <= n; i++) { // 🐞        sum += a[i];
    }
    return sum;
}
A real codebase. A real bug. You + AI.

Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.

Prompt:Correct the loop condition
Tap 'Let Jobra fix it' below to simulate AI debugging...

LG Ads Software Engineer Interview Questions & Rounds

24 min read

How the LG Ad Solutions (formerly Alphonso) software engineer interview works: campus OA, DSA and LLD rounds, from real candidate experiences.

In this article
On this page

[Draft] How to Crack LG Ad Solutions (formerly Alphonso): The Software Engineer Interview, From Real Experiences

Last updated November 20, 2026 · 22 min read · For campus candidates and Software Engineer II

Built by the Codinzhub team. This guide is built from LG Ad Solutions (formerly Alphonso) software engineer interview experiences that candidates shared, including OA questions and an experience on Codinzhub. The process changes by year, campus and level, so treat this as a map, not a promise.

The 30-second version. In this data, candidates reached LG Ad Solutions, formerly Alphonso, through Indian campus drives, a referral and a job board. On campus, both October 2026 drives started with an online assessment of 12 MCQs plus 3 coding questions, and four of the shared coding titles mention subarrays. The one Software Engineer II report had two technical interviews: two coding problems with resume and current-project questions, then a low-level design of a shopping cart with coupons on a whiteboard, with a high-level design round planned next. An older Alphonso report had a technical phone call with live coding in a shared editor. No report gives round lengths, a behavioral round or a timeline. The habit that matters most: after your first working answer, say its complexity and improve it before the interviewer asks.

What this guide is, and what it is not

This guide is built from 4 candidate reports of LG Ad Solutions (formerly Alphonso) software engineer hiring: OA questions from two Indian campus drives in October 2026, one Software Engineer II interview report, and one older report last updated in December 2019. It is a thin dataset, and no senior-level report is included.

It is:

  • A map of the process, stage by stage, as candidates described it
  • The question patterns in the reports, and the follow-ups to expect
  • A six-week plan and practice problems matched to those patterns

It is not:

  • A list of leaked questions or a promise of what you will be asked
  • An official description of LG Ad Solutions' process
  • An offer rate. Outcomes in candidate posts are self-reported and are not a statistical sample.

Important things to know before you start

These are the LG Ad Solutions facts that change how you prepare.

One company, two names. LG's newsroom announced in January 2021 that LG Electronics had taken a controlling stake of over 50 percent in Alphonso, a TV data and measurement firm, and the ad business now operates as LG Ad Solutions. Codinzhub lists its questions under both LG Ads and Alphonso, and the October 2026 campus drives used both names three days apart. LG Soft India and LG Electronics are different employers, and their interview reports are not used here.

The campus OA has two parts. Both 2026 campus drives paired 12 MCQs with 3 coding questions. The MCQ subjects and the time limit are not reported, so prepare CS fundamentals as well as coding.

Experienced loops include design. The one Software Engineer II report had a full low-level design round on a whiteboard after the coding round, and an HLD round was planned after that.

Round-by-round breakdown

Candidates described up to five stages: application, a screen or online assessment, two technical interviews for experienced hires, a planned design round, and a decision. No single report covers the whole path.

Stage 1: Application, where candidates applied

Four channels appear in the data. The campus evidence is the newest; the experienced-hire and phone-screen evidence is one report each.

ChannelWhat candidates said
Campus driveOA questions from two Indian campus drives in October 2026 are shared on Codinzhub: IIT Ropar (24 October) and IIT (BHU) Varanasi (21 October). No campus interview round is described.
ReferralOne Software Engineer II candidate from a tier-II college applied through a referral and went straight to two technical interviews.
Job boardOne older report (last updated December 2019) came through AngelList, a startup job board, and led to a phone call with live coding.
Careers pageLG Ad Solutions' careers page asks candidates to email a resume to its careers address. It lists no process steps and no office locations.

What helped. No candidate credited a specific factor for getting the interview.

Stage 2: Shortlisting, how candidates moved forward

Shortlisting is barely reported. What exists depends on the channel.

  1. Campus: the online assessment is the filter. On both campuses the first step reported is the OA (see Stage 3). Neither drive's pages give a cutoff, a CGPA rule or how many students moved on.
  2. Referral: straight to interviews. The referred Software Engineer II candidate reported no recruiter screen or test before the first technical interview.
  3. Job board: a technical phone call. In the older report, the first contact was a phone call with coding in a shared online editor. It doubled as the screen: the candidate got a rejection email about 15 minutes after it ended.

No report describes a recruiter questionnaire, a personality test or a transcript request.

What candidates advised. Nothing specific to this stage was reported.

Stage 3: Online assessment or phone screen

Campus candidates took an online assessment (OA), a timed test taken before any interview. The one older job-board report had a technical phone call instead. The referred Software Engineer II candidate had neither.

Online assessment

How it works. Both 2026 campus drives used the same shape: 12 multiple-choice questions (MCQs) plus 3 coding questions. The Codinzhub pages do not give the test length, the platform, the MCQ subjects, whether test cases were visible, or any rule on AI tools. The IIT (BHU) Varanasi pages carry the Alphonso name and the IIT Ropar pages carry the LG Ads name, three days apart, so the company may appear under either name.

At a glance

  • Length: Not reported
  • Questions: 12 MCQs plus 3 coding questions (both drives)
  • What was asked: coding titles about subarrays, counting arrangements of ads, towers and signal reachability; MCQ subjects not reported
  • Most common: No single repeated question

OA questions shared on Codinzhub. These pages show only the title, college and OA date publicly, so the topic is marked Not reported unless the page shows it.

QuestionDriveTopic
Signal reachability in D dimensionsIIT Ropar, 24 October 2026Not reported (a communication-network setting)
Brick wallIIT Ropar, 24 October 2026Not reported
Count ways to arrange adsIIT Ropar, 24 October 2026Not reported
Maximum subarray sum with exactly one duplicateIIT (BHU) Varanasi, 21 October 2026Not reported
Towers receive the fieldIIT (BHU) Varanasi, 21 October 2026Not reported (third question of the set)
Subarray sumIIT (BHU) Varanasi, 21 October 2026Not reported
Max len subarrayIIT (BHU) Varanasi, date not shownNot reported
Longest subarray with range and sum limitsIIT (BHU) Varanasi, date not shownNot reported

The IIT (BHU) Varanasi test had 3 coding questions, but 5 different titles were shared from it. Some may be the same problem under two names, or the drive may have used more than one question set. Browse every page on the LG Ads company page and the Alphonso company page, or see all OA questions in the question bank.

Phone call with a shared editor

How it works. One older report (last updated December 2019, from before the LG deal) describes a phone call while the candidate wrote code in a shared online editor. The interviewer skipped introductions and went straight to technical questions. Pseudocode was accepted for the tree question. The candidate was rejected by email about 15 minutes after the call. Treat this as a picture of the older Alphonso process, not the current one.

At a glance

  • Length: Not reported
  • Questions: about 8 short questions: 2 coding, the rest concepts and resume
  • What was asked: fast power, hash map internals, zigzag level order, JavaScript timing, databases, web basics, resume items
  • Most common: No single repeated question
QuestionWhat it testsLevel
Compute power(x, n), then optimise the recursionDivide and conquer, fast exponentiationNot reported
How a hash map works inside, and its insertion costHash table internalsNot reported
How hash maps handle collisions, and what a hash function isHash table internalsNot reported
Print a binary tree's level order in zigzag formLevel-order traversalNot reported
Predict a JavaScript setTimeout loop's output, then with setInterval and letJavaScript event loop and closuresNot reported
SQL vs NoSQL databases, then NoSQL advantages and relationsDatabase fundamentalsNot reported
Web basics: MVC, AJAX, HTTP keep-alive, git pull vs git fetchWeb and tooling fundamentalsNot reported
Resume questions: k-fold cross validation and AngularJSDepth on resume itemsNot reported

Stage 4: The interview loop

Only one report describes interviews after the screen. A Software Engineer II candidate had two technical interviews: the first mixed coding with low-level design (LLD, designing the classes of one component), resume questions and the candidate's current project; the second was an LLD problem on a whiteboard. A third, high-level design (HLD) round was planned but did not happen because the candidate did not clear the first two. No round length, behavioral round or HR round is reported for any level.

Technical interview 1 (DSA)

At a glance

  • Length: Not reported
  • Questions: 2 coding problems plus LLD, resume and current-project questions
  • What was asked: a greedy stack problem and a tree level-order problem, both named by the candidate as LeetCode problems
  • Most common: No single repeated question

The candidate gave only a brute force for the first problem and could not optimise it, then solved the second optimally. They described the interviewers as quite nice.

QuestionFollow-upLevel
Remove k digits from a number to make it smallestOptimise beyond brute force (not reached)Software Engineer II
Find the leftmost value in a binary tree's last rowNot reportedSoftware Engineer II

Technical interview 2 (low-level design)

At a glance

  • Length: Not reported
  • Questions: 1 design problem
  • Surface: whiteboard
  • What was asked: a shopping cart with discount coupons

The candidate felt this round went well and presented the design on a whiteboard, but the overall result was a rejection.

Reported designs.

  • Shopping cart with item-level and cart-level discount coupons

Stage 5: Decision and offer

Decision. No report describes a hiring committee, team matching or a level change. The two decisions on record were both rejections: the Software Engineer II candidate was turned down after the two technical interviews, before the planned HLD round, and the older job-board candidate got a rejection email about 15 minutes after the phone call, saying there was no position matching their experience and skills.

Timelines. No report gives an end-to-end timeline.

Offer. No report in this dataset describes an offer or verified compensation, so this guide does not include any.

The Codinzhub Next-Round Playbook

With four reports, this is a short list: what the stages test, and the two places where the rejected candidates said they fell short.

To get past the online assessment

  • Prepare for both parts. Both 2026 campus drives paired 12 MCQs with 3 coding questions, so revise your CS fundamentals as well as coding.
  • Expect subarray problems. Four of the five coding titles shared from the IIT (BHU) Varanasi drive mention a subarray, so be quick with prefix sums and sliding windows.
  • Write your own edge cases before you submit. Neither drive's pages say whether test cases were visible.

To get past the phone call

  • Be ready to optimise straight away. In the older report, the first question was power(x, n) and the follow-up was to make it faster.
  • Explain what you use. The candidate used a hash map and was then asked how it works inside and how it handles collisions.
  • Defend every line of your resume. The same call covered JavaScript, AngularJS and k-fold cross validation because they were on the resume, and the candidate felt weak JavaScript cost them.

To get past technical interview 1

  • Do not stop at the brute force. The Software Engineer II candidate who could not optimise Remove K Digits did not clear the rounds, despite solving the second problem optimally.
  • Expect resume and current-project questions in the same round as the coding.

To get past technical interview 2

  • Design for change. The reported prompt, a cart with coupons at two levels, rewards classes that let you add a new discount rule without editing old code.
  • Draw it. The candidate presented the design on a whiteboard.

How the loop differs by level

The evidence is too thin to compare levels properly: each level below rests on one or two reports, and none of them is senior.

LevelWhat candidates describe
Campus (level not stated)Based on two October 2026 drives (IIT Ropar and IIT (BHU) Varanasi): an OA of 12 MCQs plus 3 coding questions. Examples: signal reachability in D dimensions, count ways to arrange ads, maximum subarray sum with exactly one duplicate. No campus interview round and no system design is reported.
Software Engineer IIBased on one referral report: technical interview 1 (two coding problems plus LLD, resume and current-project questions), technical interview 2 (LLD of a shopping cart with coupons), and a planned HLD round that this candidate did not reach. Examples: Remove K Digits, Find Bottom Left Tree Value. Design shows up at this level as LLD, with HLD planned next.
Level not stated (older Alphonso report)Based on one report last updated in December 2019: a phone call with coding in a shared editor, about 8 questions on fast power, hash maps, a zigzag tree traversal, JavaScript, databases and resume items. No design question.

Senior engineer hiring is not covered by any report this guide could read in full.

Most-asked topics

Across 4 reports that describe a technical stage, no topic appears in more than 2. The campus OA titles are the largest group of questions, but their statements are not public, so their topics are not reported.

TopicWhat it meansSeen inReported examples
Trees and level-order traversalWalking a binary tree one level at a time2 of 4 reportsFind the leftmost value in a binary tree's last row; print level order in zigzag form
Optimising a brute forceTurning a slow first answer into a fast one when asked2 of 4 reportsRemove k digits to make the smallest number; compute power(x, n), then optimise
Subarray questions in the campus OAQuestions about contiguous slices of an array (titles only)1 of 4 reportsSubarray sum; max len subarray; longest subarray with range and sum limits
CS, web and resume fundamentalsConcept questions on languages, databases, the web and your resume1 of 4 reportsSQL vs NoSQL; JavaScript setTimeout output; k-fold cross validation
Hash maps from the insideHow a hash table stores keys and resolves collisions1 of 4 reportsHow a hash map works inside; how collisions are handled
Low-level class designDesigning the classes and rules of one component1 of 4 reportsShopping cart with item-level and cart-level discount coupons

The question patterns that keep coming back

With 4 technical reports, nothing truly repeats yet. These six patterns are what the reported questions resolve into, ordered by how many reports show them.

1. Trees and level-order traversal

Two reports asked a tree question, and both are level-order problems: the Software Engineer II candidate found the leftmost value in the last row, and the older phone call asked for a zigzag level order. The rule: if the question is about rows or levels, use breadth-first search (BFS) with a queue and process one level at a time. For "leftmost in the last row", remember the first node of each level; for "zigzag", reverse the order of every other level. Be ready to explain a recursive version too: the older candidate was asked about the recursion and could not explain it.

Reported examples. Find the leftmost value in a binary tree's last row; print a binary tree's level order in zigzag form.

2. Optimising a brute force: greedy stack and halving recursion

In both reports with live coding, the interviewer pushed past the first working answer. For power(x, n), the follow-up was to optimise. For Remove K Digits, the candidate's brute force was not enough. The rule: when you need the smallest number after deletions, scan left to right and pop larger earlier digits off a stack while deletions remain (a monotonic stack). When you repeat the same multiplication, halve the problem: x to the n is the square of x to the n/2, which is O(log n) and needs no memoisation, because each half is computed once.

Reported examples. Remove k digits from a number to make it smallest; compute power(x, n), then optimise the recursion.

3. Subarray questions in the campus OA

Four of the five coding titles from the IIT (BHU) Varanasi drive mention a subarray. The statements are paywalled, so the exact techniques are not reported. As general practice, not a claim about these questions: for a sum over a range, think prefix sums; for the longest subarray that stays within a limit, think sliding window; for the maximum sum, think Kadane's running best; and when a condition counts duplicates, track counts in a hash map as the window moves.

Reported examples. Maximum subarray sum with exactly one duplicate; subarray sum; max len subarray; longest subarray with range and sum limits.

4. CS, web and resume fundamentals

One report spent most of a phone call on concept questions: JavaScript timing, databases, web basics and items on the resume. The rule: for every language, framework or method on your resume, be ready to explain how it works and to predict the output of a small snippet. For the event loop, know that callbacks run only after the current loop finishes, and that let gives each loop iteration its own variable while var shares one.

Reported examples. Predict a JavaScript setTimeout loop's output, then with setInterval and let; SQL vs NoSQL databases; MVC, AJAX, HTTP keep-alive and git pull vs git fetch; k-fold cross validation and AngularJS from the resume.

5. Hash maps from the inside

The older phone call followed a coding answer with two questions on the hash map the candidate had just used. The rule: explain it as an array of buckets, where a hash function turns a key into a bucket index; collisions go into a list or tree in that bucket (chaining) or to the next free slot (open addressing); insertion is O(1) on average and the table resizes when it gets too full.

Reported examples. How a hash map works inside, and its insertion cost; how hash maps handle collisions, and what a hash function is.

6. Low-level class design (rare in the data)

One Software Engineer II report had a full round on low-level design. The rule: start from the entities (cart, item, coupon), then make each discount a separate rule object behind one interface, so item-level and cart-level coupons can be added or combined without changing the cart class. State the order in which discounts apply.

Reported examples. Shopping cart with item-level and cart-level discount coupons.

Preparing for the resume and project questions

No report describes a behavioral, values or HR round, so there are no reported behavioral prompts to prepare from. What both interview reports do show is questions about your own background: the Software Engineer II candidate was asked about their resume and current projects in technical interview 1, and the older phone call asked about resume items.

Build your story bank. Prepare a short, honest account of each project and technology you list. Cover the themes candidates were actually asked about:

ThemeReported prompt (paraphrased)Follow-up to expect
Your current projectQuestions on the project you work on now (Software Engineer II)Not reported
Your resumeResume-based questions inside a technical interview (Software Engineer II)Not reported
Methods on your resumeWhat is k-fold cross validation? (older report)Not reported
Frameworks on your resumeQuestions on AngularJS and JavaScript (older report)Predicting code output (older report)

Structure each answer. Say what the project does in one line, what you built yourself (say "I", not "we"), one design choice and why, and one result you can state.

Expect depth. In the older report, a single resume line (JavaScript) turned into several questions on the event loop and closures, and the candidate felt that weakness hurt them. Only list what you can explain.

A six-week plan

The plan follows the patterns above, the two-report patterns first, then the campus OA, and ends with timed mocks. Plan on two to three focused hours a day.

  1. Week 1: Trees and level-order traversal. BFS by level, leftmost and rightmost node per level, zigzag order, and the same problems recursively. Habit: say out loud what each call returns.
  2. Week 2: Optimising a brute force. Monotonic stack greedy (remove digits, remove duplicate letters) and halving recursion (fast power). Habit: for every problem, state the brute force and its complexity, then improve it before coding.
  3. Week 3: Subarray problems for the OA. Prefix sums, sliding windows with limits, Kadane's maximum sum, and counting duplicates in a window with a hash map. Habit: write your own edge cases (empty input, all negatives, one element).
  4. Week 4: Hash maps and fundamentals. Hash map internals and collisions, SQL vs NoSQL, HTTP keep-alive, MVC, git basics, and the language you will code in (for JavaScript, the event loop and closures). Revise CS fundamentals for the 12 MCQs. Habit: explain each concept in under a minute.
  5. Week 5: Low-level design. Design a shopping cart with item-level and cart-level coupons, then two more small systems of your choice, on paper or a whiteboard. Software Engineer II candidates: add HLD basics, since one loop planned an HLD round after the LLD. Habit: add a new requirement and check that your classes absorb it.
  6. Week 6: Mocks. Two timed OAs of 12 MCQs plus 3 coding questions, then three mock interviews that each pair a coding problem with an "optimise it" follow-up and questions on your resume. Do one mock design round on a whiteboard.

Campus candidates can keep week 5 light, since no campus interview is reported. Experienced candidates can shorten week 3, since the subarray titles come only from a campus OA.

Only two weeks? Spend three days on trees and level-order traversal, three on optimising a brute force, two on subarray problems, two on hash maps and fundamentals, two on low-level design, and two on a timed OA and mock interviews.

Practice problems that match these experiences

These are well-known practice problems that match the patterns above. They are not claims about LG Ad Solutions' question bank unless a row says the problem was asked as-is.

#Practice problemPatternSeen in these experiences as
1Find Bottom Left Tree ValueTrees, level-order traversalAsked as-is in one Software Engineer II report
2Binary Tree Zigzag Level Order TraversalTrees, level-order traversalAsked as-is in the older phone call (pseudocode accepted)
3Binary Tree Right Side ViewTrees, one node per levelPractice for the leftmost-value-in-the-last-row question
4Remove K DigitsMonotonic stack greedyAsked as-is in one Software Engineer II report
5Remove Duplicate LettersMonotonic stack greedyPractice for the same idea as Remove K Digits
6Pow(x, n)Halving recursion, fast powerCompute power(x, n), then optimise (older phone call)
7Design HashMapHash map internalsHow a hash map works inside and handles collisions
8Subarray Sum Equals KPrefix sums with a hash mapPractice for the subarray OA titles (statements not public)
9Longest Continuous Subarray With Absolute Diff Less Than or Equal to LimitSliding window with limitsPractice for the longest-subarray OA titles (statements not public)
10Maximum SubarrayKadane's running maximumPractice for the maximum-subarray-sum OA title (statement not public)

No verified practice problem matches the shopping-cart design round or the concept questions, so those are covered in the plan instead.

How to handle a question you have never seen

The coding rounds in this data were one or two problems followed by a push for a better solution, so a repeatable method matters more than memorised answers.

  1. Repeat the problem and one example. On a phone call with a shared editor, type the example into the editor so you and the interviewer agree on it.
  2. Say the brute force and its complexity. It sets a baseline, and in both live-coding reports a faster solution was expected after the first one.
  3. Name the bottleneck. Repeated lookups suggest a hash map; repeated range sums suggest prefix sums; "remove items to make the result smallest" suggests a monotonic stack; recomputing the same power suggests halving.
  4. Say when you are stuck. Say exactly which step you cannot improve. One Software Engineer II candidate stopped at the brute force for Remove K Digits and did not clear the rounds.
  5. Code in small pieces while talking. In the older phone call, pseudocode was accepted for a tree question, so ask whether full code is needed before you start.
  6. Dry-run one case and fix the wrong line. Trace your example by hand, including an edge case such as removing every digit or n equal to 0.

Why candidates were rejected

Only 2 reports in this dataset end in a known rejection, and only those 2 give any reason. Both are single reports, so read them as examples, not patterns.

  • Not optimising the first problem. The Software Engineer II candidate gave a brute force for Remove K Digits and could not optimise it. They solved the second problem optimally and felt the design round went well, but did not clear the rounds. This is what the candidate reported, not recruiter feedback.
  • No matching position. The older job-board candidate received an email about 15 minutes after the phone call saying there was no position matching their experience and skills. That is the company's stated reason.
  • Weak knowledge of something on the resume. The same candidate felt that weak JavaScript knowledge, plus a poor connection, hurt their chances. This is the candidate's own guess.

Selected vs. rejected: do this, not that

No selected candidate's interview is described in this data, so the table pairs the habits the two rejected reports point to with their opposites.

Do thisNot thatWhat the reports show
Push past the brute force: state it, then name the bottleneck and improve itStopping at the first answer: waiting for the interviewer to askOne Software Engineer II candidate could not optimise Remove K Digits and did not clear the rounds.
Know what you use: explain any data structure you reach forUsing a hash map as a black box: no answer on internalsIn the older phone call, using a hash map led straight to questions on its internals and collisions.
Trim the resume to what you can defend: every framework, every methodListing tools you cannot explain: JavaScript, AngularJS, ML termsOne candidate felt weak JavaScript knowledge from their resume hurt them.
Design for change: one interface per discount ruleOne big cart class: hard-coded discount casesThe one reported LLD round asked for coupons at both item and cart level.

If you remember only five things

  1. The process depends on the channel. Campus candidates took an OA of 12 MCQs plus 3 coding questions; one referred Software Engineer II had two technical interviews; one older applicant had a technical phone call.
  2. Expect an "optimise it" follow-up. In both live-coding reports, the first working answer was not the end of the question.
  3. Trees and level-order traversal came up twice. The leftmost value in the last row and a zigzag level order.
  4. Experienced loops include design. A shopping cart with item-level and cart-level coupons, on a whiteboard, with an HLD round planned next.
  5. Defend your resume. Both interview reports asked about resume items or current projects.

FAQ

Is there an online assessment?

For campus hiring, yes in both 2026 drives: 12 MCQs plus 3 coding questions. The referred Software Engineer II candidate had no OA, and the older job-board applicant had a phone call instead.

Is system design asked?

At Software Engineer II, yes in the one report: a low-level design round (a shopping cart with coupons), with a high-level design round planned after it. No campus interview round is reported.

Is there a behavioral or HR round?

Not reported. No report describes one; the only non-technical questions reported were about the candidate's resume and current projects.

How long does it take?

Not reported. No report gives an end-to-end timeline. The only timing on record is a rejection email about 15 minutes after the older phone call.

Is it LG Ads or Alphonso?

The same business. LG Electronics took a controlling stake in Alphonso in January 2021, and it now operates as LG Ad Solutions; Codinzhub lists questions under both names. LG Soft India is a different employer.

About this guide

The Codinzhub team researched and wrote this LG Ad Solutions software engineer interview guide from 4 candidate reports dated from 2019 to 2026, including OA questions and an interview experience shared on Codinzhub. We kept only what candidates described. The questions are our own short summaries, and the practice links are similar problems unless a row says the problem was asked as-is. This is a thin dataset; if you interviewed recently, share your experience on Codinzhub and we will update this guide.

Disclaimer. LG Ad Solutions' process changes by role, year and office. Use this guide to build a foundation, and confirm the current format with your recruiter or placement cell.

Search the question bank

The questions from each round above, with practice links for similar problems. Log in to search every question we collected for this role, including questions shared on Codinzhub.

Showing 20 of 47 questions

  • Signal reachability in D dimensions

    A Lg Ads online assessment question shared on Codinzhub (IIT Ropar, 24 October 2026).

    On CodinzhubIIT Ropar, 24 October 2026Not reported (a communication-network setting)CodingOnline assessment
  • Brick wall

    A Lg Ads online assessment question shared on Codinzhub (IIT Ropar, 24 October 2026).

    On CodinzhubIIT Ropar, 24 October 2026Not reportedCodingOnline assessment
  • Count ways to arrange ads

    A Lg Ads online assessment question shared on Codinzhub (IIT Ropar, 24 October 2026).

    On CodinzhubIIT Ropar, 24 October 2026Not reportedCodingOnline assessment
  • Maximum subarray sum with exactly one duplicate

    A Lg Ads online assessment question shared on Codinzhub (IIT (BHU) Varanasi, 21 October 2026).

    On CodinzhubIIT (BHU) Varanasi, 21 October 2026Not reportedCodingOnline assessment
  • Towers receive the field

    A Lg Ads online assessment question shared on Codinzhub (IIT (BHU) Varanasi, 21 October 2026).

    On CodinzhubIIT (BHU) Varanasi, 21 October 2026Not reported (third question of the set)CodingOnline assessment
  • Subarray sum

    A Lg Ads online assessment question shared on Codinzhub (IIT (BHU) Varanasi, 21 October 2026).

    On CodinzhubIIT (BHU) Varanasi, 21 October 2026Not reportedCodingOnline assessment
  • Max len subarray

    A Lg Ads online assessment question shared on Codinzhub (IIT (BHU) Varanasi, date not shown).

    On CodinzhubIIT (BHU) Varanasi, date not shownNot reportedCodingOnline assessment
  • Longest subarray with range and sum limits

    A Lg Ads online assessment question shared on Codinzhub (IIT (BHU) Varanasi, date not shown).

    On CodinzhubIIT (BHU) Varanasi, date not shownNot reportedCodingOnline assessment
  • Compute power(x, n), then optimise the recursion

    Level: Not reported.

    Divide and conquer, fast exponentiationCodingRound not stated
  • How a hash map works inside, and its insertion cost

    Level: Not reported.

    Hash table internalsCodingRound not stated
  • How hash maps handle collisions, and what a hash function is

    Level: Not reported.

    Hash table internalsCodingRound not stated
  • Print a binary tree's level order in zigzag form

    Level: Not reported.

    Level-order traversalCodingRound not stated
  • Predict a JavaScript setTimeout loop's output, then with setInterval and let

    Level: Not reported.

    JavaScript event loop and closuresCodingRound not stated
  • SQL vs NoSQL databases, then NoSQL advantages and relations

    Level: Not reported.

    Database fundamentalsCodingRound not stated
  • Web basics: MVC, AJAX, HTTP keep-alive, git pull vs git fetch

    Level: Not reported.

    Web and tooling fundamentalsCodingRound not stated
  • Resume questions: k-fold cross validation and AngularJS

    Level: Not reported.

    Depth on resume itemsCodingRound not stated
  • Remove k digits from a number to make it smallest

    Level: Software Engineer II.

    Optimise beyond brute force (not reached)CodingRound not stated
  • Find the leftmost value in a binary tree's last row

    Level: Software Engineer II.

    Not reportedCodingRound not stated
  • Trees and level-order traversal

    Level: 2 of 4 reports.

    Walking a binary tree one level at a timeCodingRound not stated
  • Optimising a brute force

    Level: 2 of 4 reports.

    Turning a slow first answer into a fast one when askedCodingRound not stated
Page 1 of 3

Keep preparing on Codinzhub

Ready for the next topic?

Keep track of what you’ve learned.