Loyalty Juggernaut interview questions

Loyalty Juggernaut OA Experience (2026) I recently appeared for the Loyalty Juggernaut Online Assessment through my college placement process. Sharing the pattern and topics for future candidates. Round 1: Online Assessment The OA consisted of two parts (Part A + Part B). Part A MCQs (5 Questions) The MCQs were based on core CS fundamentals: 2 Questions on Time Complexity of given code snippets 1 Question on DBMS Locks (Shared/Exclusive Lock concept) 1 Output Prediction question 1 Array Indexing / Basic Programming question No aptitude or quantitative reasoning questions were asked. Coding Section (4 Questions) Easy Question 1 Given a range L and R and an integer K, find an integer X such that the total number of digits required to write all numbers from L to X is exactly K. Return -1 if no such number exists. The intended solution seems to involve mathematical digit counting and binary search. Easy Question 2 String validation problem. A string was considered valid if it followed specific allowed patterns (similar to constructing the string using predefined blocks such as "1" and "221" while satisfying an ending condition). A greedy/string traversal solution works. Medium Question 1 Given numbers from 1 to N: Remove alternate elements (1st, 3rd, 5th, ...) Repeat the same process on the remaining elements Continue until only one element remains Return the sum of all removed elements (excluding the final remaining element). The question required identifying a mathematical pattern rather than straightforward simulation. Medium Question 2 Given a lowercase string and an integer K, count the number of substrings where at least one character appears K or more times. A brute-force solution receives partial marks, while the intended solution is based on sliding window/frequency counting. Partial Marking Each coding problem had multiple test cases with partial scoring, so even partially correct solutions received marks. Easy questions: 25 marks each Medium questions: 50 marks each Part B (Theoretical Section) After coding, there was a separate section where two coding/theoretical questions had to be explained in words. Instead of writing code, candidates had to describe: Approach Logic Algorithm/Reasoning There was a 5-minute time limit for this section. Question Variations The coding questions were not identical for everyone. For example, one candidate received a medium question similar to the Trapping Rain Water problem, while others received different medium-level DSA questions. Overall Difficulty Section Difficulty MCQs Easy – Medium Easy Coding Easy Medium Coding Medium Part B Medium (requires clear algorithmic explanation) Topics to Prepare Arrays & Strings Sliding Window Greedy Mathematical Observations Prefix Sum Binary Search on Answer DBMS Locks Time Complexity Analysis Output Prediction Ability to explain an algorithm without writing code Overall, the OA focused more on problem-solving and DSA fundamentals than on advanced algorithms or competitive programming. The presence of partial marking and a theoretical explanation section made it different from a typical coding assessment.

I applied through the campus placement.First round is online assessment.which consist of 4 dsa questions and 5 mcqs .In that the questions I got are one is from the k smallest integer, and count the subarrays with some condition,and 2 more also based on arrays but a bit difficulty in that questions.