Licious Placement Papers 2025

Overview

This page is a working set of Licious placement papers from 2025: from student reports questions, the 2025 online assessment pattern, and step-by-step solutions. Use it to see what Licious actually asked in the latest cycle, how hard the rounds were, and which themes (DSA, system design, aptitude, or role-specific topics) mattered most. Practice the problems below under timed conditions, then cross-check with the interview and preparation guides if you are targeting an upcoming Licious drive.

2025 Updates

The 2025 Licious placement process maintains focus on DSA and system design with enhanced emphasis on e-commerce architecture.

Licious Online Assessment 2025 pattern

Section	Questions	Time	Difficulty
Coding Problems	2-3	90 min	Medium-Hard

Licious Placement Papers 2025 - actual questions & solutions

This section contains practice questions styled on Licious placement papers 2025 (recent-cycle pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.

Question 1: reverse a string

Show solution

Problem Statement: Given a string, return it reversed.

Example:

Input: "placement"
Output: "tnemecalp"

Solution (Java):

public String reverse(String s) {
    return new StringBuilder(s).reverse().toString();
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 2: valid parentheses

Show solution

Problem Statement: Given a string of brackets, determine if it is valid.

Example:

Input: "()[]{}"
Output: true

Solution (Java):

public boolean isValid(String s) {
    Deque<Character> st = new ArrayDeque<>();
    Map<Character, Character> pair = Map.of(')', '(', ']', '[', '}', '{');
    for (char c : s.toCharArray()) {
        if (pair.containsValue(c)) st.push(c);
        else if (st.isEmpty() || st.pop() != pair.get(c)) return false;
    }
    return st.isEmpty();
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 3: check palindrome

Show solution

Problem Statement: Return true if the string reads the same forward and backward (ignore case).

Example:

Input: "Level"
Output: true

Solution (Java):

public boolean isPalindrome(String s) {
    s = s.toLowerCase();
    int i = 0, j = s.length() - 1;
    while (i < j) {
        if (s.charAt(i++) != s.charAt(j--)) return false;
    }
    return true;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 4: two sum

Show solution

Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.

Example:

Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]

Solution (Java):

public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int need = target - nums[i];
        if (map.containsKey(need)) return new int[]{map.get(need), i};
        map.put(nums[i], i);
    }
    return new int[]{};
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 5: climbing stairs

Show solution

Problem Statement: You can climb 1 or 2 steps. How many distinct ways to climb n stairs?

Example:

Input: n = 4
Output: 5

Solution (Java):

public int climbStairs(int n) {
    if (n <= 2) return n;
    int a = 1, b = 2;
    for (int i = 3; i <= n; i++) {
        int c = a + b; a = b; b = c;
    }
    return b;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 6: first non-repeating character

Show solution

Problem Statement: Return the first non-repeating character in a string, or ‘_’ if none.

Example:

Input: "swiss"
Output: 'w'

Solution (Java):

public char firstUnique(String s) {
    int[] freq = new int[256];
    for (char c : s.toCharArray()) freq[c]++;
    for (char c : s.toCharArray()) if (freq[c] == 1) return c;
    return '_';
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 7: binary tree level order

Show solution

Problem Statement: Return the level-order traversal of a binary tree.

Example:

Input: [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]

Solution (Java):

public List<List<Integer>> levelOrder(TreeNode root) {
    List<List<Integer>> res = new ArrayList<>();
    if (root == null) return res;
    Queue<TreeNode> q = new ArrayDeque<>();
    q.add(root);
    while (!q.isEmpty()) {
        int sz = q.size();
        List<Integer> level = new ArrayList<>();
        for (int i = 0; i < sz; i++) {
            TreeNode n = q.poll();
            level.add(n.val);
            if (n.left != null) q.add(n.left);
            if (n.right != null) q.add(n.right);
        }
        res.add(level);
    }
    return res;
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 8

Q8: Worst-case time complexity of quicksort is?

Solution:

Unbalanced partitions (already sorted with bad pivot) → O(n²).

Answer: O(n²)

Question 9

Q9: Time complexity of binary search on a sorted array of n elements is?

Solution:

Each step halves the search space → O(log n).

Answer: O(log n)

Question 10

Q10: Which normal form removes transitive dependency?

Solution:

1NF: atomic values. 2NF: no partial dependency. 3NF: no transitive dependency.

Answer: 3NF

Question 11

Q11: Which protocol is connection-oriented at the transport layer?

Solution:

TCP is connection-oriented; UDP is connectionless.

Answer: TCP

Key insights from 2025 Licious Online Assessment

1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
2. E-commerce Architecture Focus: Strong emphasis on e-commerce systems, order processing, inventory management, supply chain
3. Time Management: 2-3 problems in 90 minutes requires excellent speed and accuracy
4. Success Rate: Only 10-15% cleared OA and advanced to interviews
5. Platform: Licious assessment platform or HackerRank
6. Focus Areas: Arrays, trees, graphs, dynamic programming, e-commerce architecture, order processing
7. Enhanced Emphasis: Optimal solutions, e-commerce architecture, and order processing system design

Licious 2025 interview experiences

Based on recent candidate experiences from 2025 Licious interviews:

2025 Interview Process:

1. Online Assessment (90 minutes): 2-3 coding problems
2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions, e-commerce concepts, order processing
3. Onsite/Virtual Interviews (4-5 rounds, 45-60 minutes each):

• Coding rounds (2-3): Algorithms, data structures, problem-solving
• System Design rounds: E-commerce architecture, order processing systems, inventory management, supply chain systems
• Behavioral rounds: Problem-solving approach, e-commerce passion, impact

2025 Interview Trends:

• Increased emphasis on e-commerce architecture and order processing system design
• More focus on optimal solutions and modern e-commerce technologies
• Enhanced behavioral questions about innovation and e-commerce passion
• Questions about e-commerce architecture and order processing systems

Common 2025 Interview Topics:

• Coding: Arrays, strings, trees, graphs, dynamic programming, order processing algorithms
• System Design: E-commerce architecture, order processing systems, inventory management, supply chain systems
• Behavioral: Problem-solving, e-commerce passion, teamwork, impact
• Licious Technologies: E-commerce architecture, order processing systems, inventory management, supply chain systems

Success Tips:

• Strong coding performance is essential - solve problems optimally
• Understand e-commerce concepts, order processing, and e-commerce architecture
• Practice system design for e-commerce architecture and order processing systems
• Prepare examples demonstrating problem-solving and e-commerce passion
• Learn Licious’s products and e-commerce technologies
• Practice explaining your thought process clearly

For detailed interview experiences from 2025, visit Licious Interview Experience page.

Preparation tips for Licious 2025 pattern

1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
2. E-commerce Architecture Expertise: Strong understanding of e-commerce architecture, order processing systems, inventory management
3. Practice Previous Year Papers: Solve Licious OA papers from 2020-2025 to understand evolving patterns
4. Time Management: Practice completing 2-3 coding problems in 90 minutes
5. LeetCode Practice: Solve 200+ LeetCode problems focusing on arrays, strings, trees, graphs (medium-hard difficulty)
6. E-commerce Focus: Practice problems related to e-commerce systems and order processing
7. System Design Mastery: Learn e-commerce architecture design, order processing systems, inventory management
8. Licious Technologies: Learn e-commerce architecture, order processing systems, inventory management, supply chain systems
9. Behavioral Preparation: Prepare examples using STAR format - problem-solving, e-commerce passion, impact
10. Mock Tests: Take timed practice tests to improve speed and accuracy

Related resources

Licious 2024 papers→

Previous year Licious placement papers with questions and solutions

Licious coding questions→

Complete collection of Licious coding problems with solutions

Licious interview experience→

Real interview experiences from successful candidates

Licious preparation guide→

Comprehensive preparation strategy for Licious placement

Licious main page→

Complete Licious placement guide with eligibility, process, and salary

Similar companies

Blinkit · Meesho · Google · Amazon · Microsoft · TCS

---

Practice 2025 papers to stay updated with latest patterns and prepare effectively!