Juspay Hiring Challenge 2025:Preparation Guide + Previous Year Coding Questions (PYQs)

Prepare smarter, not harder. This all-in-one guide covers the structure, syllabus, resources, and 20 most asked Juspay coding questions (2023–2025) to help you crack the challenge and land a ₹27 LPA offer!

What is Juspay Hiring Challenge?

The Juspay Hiring Challenge 2025 is an elite recruitment drive by Juspay Technologies, targeting engineering students graduating in 2026. It’s a golden opportunity to work with a high-scale fintech company.

Highlights:

  • Paid Internship: ₹40,000/month (8–12 months)
  • Full-time CTC: ₹21–27 LPA
  • Locations: Bangalore (in-office only)
  • Eligible: All B.Tech/B.E. branches (2026 pass-outs)

Selection Process: Rounds Breakdown

1. Demo Assessment (Optional)

  • Platform familiarity test
  • Not evaluative or mandatory

2. Round 1 – MCQ Assessment

  • Covers:
    • Data Structures & Algorithms
    • OS, CN, DBMS
    • Logical Reasoning
    • Physics & Math
  • Time-bound with an open window for attempt

✅Practice for free for MCQ round - Lets Code

3. Round 2 – Coding Challenge

  • Duration: 90 mins
  • 2–3 coding questions (medium-hard)
  • Evaluated on time, code quality, logic

4. Final Interviews

  • 1–2 Technical Interviews
  • Covers DSA, Projects, Problem Solving, System Design

Syllabus & Key Topics

  • DSA: Arrays, Strings, Trees, Graphs, DP, Recursion
  • CS Core: OS, CN, DBMS, OOP
  • Logic & Math: Probability, Sequences, Aptitude, Physics concepts
  • Coding Skills: Edge case handling, efficient code writing

Resources for Preparation

MCQs & Fundamentals

Coding Practice

Juspay Previous Year Coding Questions (2023–2025)

1. Stars Between Bars

  • Problem: Count stars between bars | in substring ranges.
  • Example: s = "|**|*|", start = [0, 0], end = [4, 5] → [2, 2]
  • Topics: String, Array
  • Difficulty: Easy–Medium

2. Lexicographical Order of Substring IDs

  • Problem: Find the last substring in lexicographical order.
  • Example: "abcde" → "e", "adbc" → "dc"
  • Topics: Strings, Sorting
  • Difficulty: Medium

3. Maximum Weight Node

  • Problem: Find node with max weight in a forest.
  • Topics: Trees, Graphs, DFS/BFS
  • Difficulty: Easy–Medium

4. Largest Cycle

  • Problem: Find largest sum cycle in a directed graph.
  • Topics: Graph, DFS
  • Difficulty: Medium

5. Meeting Cell

  • Problem: Find the meeting cell of two entities in a grid.
  • Topics: BFS, Grid Traversal
  • Difficulty: Hard

6. Tree of Space

  • Problem: Space optimization in a tree structure (multithreaded safe).
  • Topics: Trees, Graphs, Optimization
  • Difficulty: Hard

7. Sort String by Character Frequency

  • Problem: Sort characters by frequency, then lexicographically.
  • Topics: Hashing, Sorting
  • Difficulty: Medium

8. Remove Stars and Adjacent Characters

  • Problem: Remove each * and its neighbors from string.
  • Topics: Stack, Strings
  • Difficulty: Medium

9. Longest Consecutive Sequence

  • Problem: Find longest sequence of consecutive numbers.
  • Topics: Arrays, Sets
  • Difficulty: Easy–Medium

10. Median in a Bucket

  • Problem: Add number or return median after each operation.
  • Topics: Heap, Priority Queue
  • Difficulty: Medium–Hard

11. Sort Transactions by Date

  • Problem: Sort a list of transactions using dates.
  • Topics: Sorting
  • Difficulty: Easy

12. Longest Subsequence of Transactions

  • Problem: Maximize total value of transaction subsequence.
  • Topics: Dynamic Programming
  • Difficulty: Medium–Hard

13. Reverse a Singly Linked List

  • Problem: Reverse a linked list in place.
  • Topics: Linked List
  • Difficulty: Easy

14. Height of a Binary Tree

  • Problem: Find height or check if tree is balanced.
  • Topics: Recursion, Trees
  • Difficulty: Medium

15. Payment Gateway Simulation

  • Problem: Validate card number, CVV, and expiry date.
  • Topics: String manipulation
  • Difficulty: Medium

16. Optimize Transaction Data Storage

  • Problem: Efficiently store data under memory limits.
  • Topics: Optimization, Data Structures
  • Difficulty: Hard

17. Converging Maze: Largest Sum Cycle

  • Problem: Largest cycle sum in maze graph.
  • Topics: Graph, DFS
  • Difficulty: Medium–Hard

18. Nearest Cell

  • Problem: Find nearest valid cell under constraints.
  • Topics: BFS, Graph
  • Difficulty: Medium

19. Lowest Common Ancestor in a Binary Tree

  • Problem: Return LCA of two given nodes.
  • Topics: Recursion, Binary Tree
  • Difficulty: Medium

20. Maximize Player Score (Game Theory)

  • Problem: Alternate picking to maximize Player 1’s score.
  • Input: [2, 4, 6, 10, 8, 16, 12, 1]
  • Topics: Dynamic Programming
  • Difficulty: Hard

Final Tips for Cracking Juspay

  • 💡 Focus more on problem-solving than language syntax.
  • 🧠 Master medium-level DSA problems first.
  • ⏱️ Practice under time pressure using mock tests.
  • 🚫 Avoid plagiarism or multiple IDs — it leads to instant disqualification.
  • 🧪 Be interview-ready with strong project explanation & code clarity.

🧰 Useful Resources for Your Placement Prep

👉 Join now if you’re participating in Juspay 2025 or have doubts — Join our Telegram group for any doubts!

Also join our Whatsapp channel for latest opportunity updates!