Zerodha is India's largest retail stockbroker, founded in 2010 by Nithin Kamath and Nikhil Kamath. It revolutionized the Indian brokerage industry with its discount brokerage model, offering zero brokerage on investments and a flat fee on intraday and futures and options trades. Zerodha also provides an array of technology-driven trading platforms like Kite, Coin, and Varsity, aimed at enhancing the trading experience for retail investors.
Computer Science, Information Technology, Finance, or related fields
Minimum Marks
60% or above in the last degree
Year of Graduation
Within the last 2-3 years for entry-level positions
Skill Set Requirements
Proficiency in programming languages, data analysis, financial markets knowledge, problem-solving skills
Internship and Work Experience
Relevant internships preferred, 1-2 years of work experience for mid-level roles
Additional Criteria
Strong analytical skills, good communication skills, and ability to work in a team
Zerodha Recruitment Process
Zerodha conducts multiple rounds to select candidates for various technical positions in their organization. Here is a detailed breakdown:
1. Online Application
Step: Submit applications through the Zerodha careers page or job portals.
Details: Ensure your resume highlights relevant skills and experiences.
2. Resume Screening
Process: HR team reviews applications based on qualifications and job requirements.
Criteria: Educational background, relevant experience, and skillset.
3. Assessment Tests
Cognitive and Technical Assessments:
Logical Reasoning: Assess pattern recognition, puzzles, arrangements, and critical thinking.
Verbal Ability: Evaluate reading comprehension, grammar, vocabulary, and sentence completion.
Quantitative Aptitude: Test arithmetic, algebra, geometry, mensuration, and data interpretation skills.
Coding Assessment: Focus on algorithm design, data structures, and debugging. Common platforms used include HackerRank.
4. Technical Interviews
Rounds: Typically 2-3 rounds focusing on various technical aspects.
Focus Areas:
Programming Languages: Proficiency in languages like Java, Python, C++.
Software Development Principles: Understanding of software engineering best practices.
Problem-Solving: Ability to solve complex problems efficiently.
Domain Knowledge: Questions related to specific roles such as databases, web development, DevOps, etc.
5. Group Discussion (GD)
Purpose: Assess communication skills, team dynamics, and ability to articulate thoughts clearly.
Format: Topic-based discussions to evaluate collaborative skills and analytical thinking.
6. HR Interview
Focus:
Behavioral Questions: Understand candidate’s fit within the company culture.
Situational Judgments: Evaluate how candidates handle specific situations.
Compensation and Benefits: Discuss salary expectations, benefits, and other job specifics.
Logistics: Work hours, location (remote/on-site), and joining date.
7. Documentation and Offer
Background Verification: Conducted to verify the candidate’s credentials.
Offer Letter: Successful candidates receive an offer outlining the job role, salary, and other terms.
Onboarding: Introduction to Zerodha’s culture, team, and initial training.
Preparation Tips
Coding: Practice coding problems on platforms like HackerRank, LeetCode.
System Design: Study system design principles and review relevant interview questions.
Mock Interviews: Participate in mock interviews with peers or use services like Pramp.
Projects: Highlight any relevant projects on GitHub or personal portfolio
Questions Asked in the Recruitment Process
Here are five Data Structures and Algorithms (DSA) topics that are commonly focused on during the recruitment process at Zerodha:
Arrays and Strings:
Questions may involve operations on arrays, manipulation of strings, finding subarrays with certain properties, and string pattern matching.
Linked Lists:
Topics include reversing linked lists, detecting cycles, merging two sorted lists, and removing nth node from the end.
Binary Trees and Binary Search Trees (BSTs):
Problems related to tree traversals (in-order, pre-order, post-order), finding the lowest common ancestor, and balancing BSTs.
Dynamic Programming:
Questions involving optimization problems such as the longest increasing subsequence, knapsack problem, and dynamic programming on trees.
Graphs:
Problems on graph traversal algorithms like Breadth-First Search (BFS) and Depth-First Search (DFS), shortest path algorithms (Dijkstra’s and Bellman-Ford), and detecting cycles in a graph.
Example Questions
Arrays and Strings: Find the maximum subarray sum using Kadane's Algorithm.
Linked Lists: Detect and remove a cycle in a linked list.
Binary Trees: Implement a function to check if a binary tree is a valid BST.
Dynamic Programming: Solve the 0/1 knapsack problem.
Graphs: Find the shortest path in a weighted graph using Dijkstra's Algorithm.
