M
Fashnear Technologies (Meesho) Interview Guide
For Freshers — India 2026
Hard Difficulty💰 ₹18–30 LPA👥 200–400 freshers/year📝 4 Questions
About the Meesho Interview Process
Meesho is India's fastest-growing social commerce platform, serving Tier 2–3 India with zero-commission model. Backed by SoftBank and Fidelity, Meesho's engineering team solves unique challenges: low-bandwidth optimization, vernacular language support, logistics for 500,000+ pin codes. Fresher packages are highly competitive.
Interview Rounds
- 1Online Coding Assessment
- 2Technical Phone Screen
- 32–3 Technical Interviews
- 4Culture Fit Discussion
Insider Tips to Crack Meesho
- ✓Meesho's coding round is competitive — solve both problems fully for selection
- ✓Study DSA: trees, graphs, DP — LeetCode Medium-Hard is the benchmark
- ✓Meesho serves Bharat (Tier 2-3 India) — understand the user context in behavioral rounds
- ✓Show curiosity about scale problems: serving users on 2G, multilingual UX, last-mile delivery
- ✓Research Meesho's zero-commission model, reseller network, and logistics arm
Meesho Interview Questions & Answers
Q1. How would you optimize an app for users on 2G/slow networks?
TechnicalModel Answer:
Key strategies: (1) Image optimization — WebP format, lazy loading, progressive JPEG; (2) API optimization — paginate responses, compress with gzip/brotli, reduce payload size; (3) Offline-first — cache critical data with Service Workers; (4) Code splitting — load only needed JS chunks; (5) Reduce round trips — batch API calls, use HTTP/2 multiplexing; (6) CDN with edge nodes near Tier 2/3 cities. Meesho's real-world solution: 70% image compression, skeleton screens for perceived performance.
Q2. Implement LRU Cache.
CodingModel Answer:
Use HashMap + Doubly Linked List: O(1) get and put.
```python
from collections import OrderedDict
class LRUCache:
def __init__(self, capacity):
self.cap = capacity
self.cache = OrderedDict()
def get(self, key):
if key not in self.cache: return -1
self.cache.move_to_end(key); return self.cache[key]
def put(self, key, value):
if key in self.cache: self.cache.move_to_end(key)
self.cache[key] = value
if len(self.cache) > self.cap: self.cache.popitem(last=False)
```
LeetCode #146 — frequently asked at product companies.
Q3. What is eventual consistency in distributed systems?
TechnicalModel Answer:
Eventual consistency means that if no new updates are made, all replicas of data will eventually converge to the same value — but reads may temporarily return stale data. Used in high-availability systems where partition tolerance is critical (CAP theorem: choose CP or AP). Examples: Amazon DynamoDB, Apache Cassandra. In Meesho's context: product inventory count may show slightly stale data across regions but eventual consistency ensures all nodes sync within milliseconds to seconds.
Q4. Why Meesho over bigger companies like Flipkart or Amazon?
HR / BehavioralModel Answer:
'Meesho's mission to democratize e-commerce for Bharat — the 500M+ Indians in Tier 2–3 cities who couldn't participate in online commerce before — is genuinely exciting. I'd have more ownership and impact at my scale of career. At Amazon, I'd be one of thousands; at Meesho, I can see my features reach real users who genuinely need them. The technical challenges of serving low-bandwidth users at scale are also uniquely interesting.'
Also Prepare For
Cracked the Interview? Get Direct HR Access
JobHuntDaily connects you directly with HRs at top companies — skip job portals that ghost you.
Get Matched — Start for ₹2