Free tool · no sign-up · 4 interview rounds
Generate AI-powered CRED interview questions for all 4 rounds. Process: DSA Screen → Technical × 2 → System Design → HR.
From our curated bank of 10 CRED-specific questions. The generator produces fresh AI-tailored questions each run.
What is CRED's product and why does it attract high-calibre engineering talent?
Tip: CRED: credit card bill payment + rewards platform for India's creditworthy population. Engineering appeal: hypergrowth startup, hard ML problems (credit scoring, fraud), complex UX craft requirements, and a famously high engineering bar. CRED interviews are among the hardest in India — expect deep dives on every answer.
Design CRED's credit card bill payment reminder and nudge system.
Tip: Trigger: N days before due date (personalised — 3/5/7 days based on user responsiveness history). Channel selection: push → SMS → email based on click-through rates. ML model: predict optimal send time per user (open rate maximisation). Deduplication: one nudge per day per user. A/B test message variants.
How would you build a fraud detection system for CRED's high-value credit card transactions?
Tip: Features: transaction amount vs typical spend (z-score), new merchant category, unusual hour, device fingerprint change, location velocity (two cities in 10 min). Ensemble: rule engine (<1ms blocking obvious fraud) + gradient boosting model (5ms) + post-transaction async deep analysis. Feedback loop: dispute outcomes retrain the model.
What is CRED's engineering philosophy around code elegance and simplicity?
Tip: CRED is known for hiring engineers who care about craft — clean APIs, simple abstractions, readable code. In interviews: interviewers will ask you to simplify a solution you've given. Practice refactoring: after solving a problem, ask yourself 'can I make this 30% shorter without sacrificing clarity?'
Write code to implement a Least Frequently Used (LFU) cache.
Tip: Data structures: HashMap<key, value>, HashMap<key, frequency>, HashMap<frequency, LinkedHashSet<keys>> (ordered set for LRU within same frequency), min_freq counter. Get: increment frequency, update freq maps. Put: on overflow, evict min_freq key. All operations O(1). One of the hardest LeetCode Hard cache problems.
Practise questions for each stage to maximise your preparation.
Upload your resume and get scored on technical depth, communication, structure, confidence, and relevance — the same criteria CRED panels use.