Slice Placement Papers 2026 — Complete Preparation Guide

Last Updated: March 2026

Company Overview

Slice is a fintech unicorn providing payment cards and credit products to young Indians. It's known for innovative products and strong engineering culture.

Key Facts:

Founded: 2016
Employees: 1000+
India Offices: Bangalore (HQ)
Valuation: $1.5+ billion

Eligibility Criteria

Criteria	Requirement
Degree	B.Tech/B.E, M.Tech
Branches	CSE, IT
Academic Score	70%+ throughout
Backlogs	No active backlogs

CTC & Compensation

Role	CTC (Fresher)
Software Engineer	10-18 LPA
Backend Engineer	12-20 LPA

Exam Pattern

Section	Questions	Duration
Aptitude	15	20 min
Technical MCQ	15	20 min
Coding	2-3	75 min

Aptitude Questions

Q1

A is twice as good as B. Together they finish in 14 days. A alone? Answer: 21 days

Q2

Sum of money doubles in 5 years at SI. Rate %? Answer: 20%

Q3

Ratio 3:4, if 10 added to both becomes 5:6. Original numbers? Answer: 15 and 20

Q4

Train 150m crosses pole in 9 sec. Speed in km/hr? Answer: 60 km/hr

Q5

In how many ways can 6 people sit around a table? Answer: 120

Technical Questions

Explain credit card payment flow
Difference between credit and debit cards
What is PCI DSS compliance?
Event-driven architecture
API rate limiting techniques

Coding Questions (Python)

Q1: Merge Intervals

def merge_intervals(intervals):
    if not intervals:
        return []
    intervals.sort(key=lambda x: x[0])
    merged = [intervals[0]]
    for current in intervals[1:]:
        last = merged[-1]
        if current[0] <= last[1]:
            last[1] = max(last[1], current[1])
        else:
            merged.append(current)
    return merged

Q2: Word Break

def word_break(s, word_dict):
    dp = [False] * (len(s) + 1)
    dp[0] = True
    for i in range(1, len(s) + 1):
        for j in range(i):
            if dp[j] and s[j:i] in word_dict:
                dp[i] = True
                break
    return dp[len(s)]

Q3: Clone Graph

class Node:
    def __init__(self, val=0, neighbors=None):
        self.val = val
        self.neighbors = neighbors if neighbors else []

def clone_graph(node):
    if not node:
        return None
    visited = {}
    def dfs(n):
        if n in visited:
            return visited[n]
        clone = Node(n.val)
        visited[n] = clone
        for neighbor in n.neighbors:
            clone.neighbors.append(dfs(neighbor))
        return clone
    return dfs(node)

Interview Tips

Fintech Interest: Show passion for payments/lending
Security Focus: Understanding of secure coding
Distributed Systems: Basic concepts
Problem Solving: Creative and efficient solutions
Culture Fit: Young, dynamic mindset

FAQs

Q1: Does Slice hire freshers? Limited campus hiring Q2: Tech stack? Go, Python, React, Kubernetes Q3: Work culture? Fast-paced, high ownership

All the best for your Slice placement!