Filter interviews by
A recursive function is a function that calls itself within its definition.
A recursive function must have a base case to prevent infinite recursion.
It can be used to solve problems that can be broken down into smaller, similar subproblems.
Examples include factorial calculation and Fibonacci sequence generation.
Top trending discussions
Interview experience
Senior Consultant
341
salaries
| ₹11.1 L/yr - ₹35 L/yr |
Consultant
308
salaries
| ₹6.5 L/yr - ₹21 L/yr |
Engineer
296
salaries
| ₹5.5 L/yr - ₹19.9 L/yr |
Territory Business Manager
217
salaries
| ₹2.8 L/yr - ₹11.2 L/yr |
Associate Engineer
189
salaries
| ₹3.7 L/yr - ₹9 L/yr |
Pfizer
GlaxoSmithKline Pharmaceuticals
Novartis
Sanofi