ZOHO Offcampus Interview Experience 2025

zoho corporation logo
zoho corporation
April 7, 2025 β€’ 22 reads

Summary

Hey everyone! πŸ‘‹
I recently appeared for the Zoho off-campus drive held on April 4th, and I wanted to share my experience here. The drive saw a huge turnout of around 1500+ candidates, and by the end, only about 10–12 students were shortlisted. Though I couldn’t make it past the third round, I learned a lot and hope this post helps someone preparing for it in the future.

Full Experience

πŸš€ My Zoho Off-Campus Drive Experience – April 4th, 2025

Hey everyone! πŸ‘‹
I recently appeared for the Zoho off-campus drive held on April 4th, and I wanted to share my experience here. The drive saw a huge turnout of around 1500+ candidates, and by the end, only about 10–12 students were shortlisted. Though I couldn’t make it past the third round, I learned a lot and hope this post helps someone preparing for it in the future.


πŸ”Ή Round 1 – Aptitude + Java Snippets

This was the first and major filtration round.
We had 20 questions in total:

  • 10 Aptitude questions – Medium level (time, speed, probability, logical reasoning)
  • 10 Java code snippet questions – Tough and conceptually heavy

⏱ Duration: 75 minutes
βœ… Only 90–100 students were shortlisted from the original 1500 in this round!

Tip: Make sure you’re strong in both logic-building and Java fundamentals. And yes, practice aptitude thoroughly β€” it was definitely the toughest round.


πŸ”Ή Round 2 – Data Structures & Algorithms

This was a coding round with 7 questions of medium level.

The topics included:

  • Trees (e.g., Validate BST)
  • HashMaps
  • Arrays & Strings
  • Sliding Window problems (both fixed and variable size)

The questions asked in this round were

  • 1. Validate BST
  • 2. length of longest substring having distinct characters
  • 3. Check palindrome
  • 4. FInd first missing Positive
  • 5. Number of substring having exactly k characters
  • 6. Find the first non repeating character in a string in 1 pass
  • 7. I forgot this question and it was easy itself

βœ… Around 40–50 candidates cleared this round.

Tip: Focus on conceptual clarity and edge case handling. Practicing on platforms like LeetCode or GeeksForGeeks really helps here.


πŸ”Ή Round 3 – Low-Level Design (LLD)

This round was unexpectedly challenging.
We were asked to design a Task Manager application, and the interview was structured in 8 progressive steps:

  • Starting from basic design
  • Adding persistence using local file storage
  • Handling multiple edge cases and improving functionality step by step

βœ… Only 10–15 students made it to the next technical face-to-face round mostly all of them got selected ig.

Unfortunately, this is where my journey ended.


❌ My Outcome & Personal Thoughts

Despite performing decently, I wasn’t shortlisted after LLD. I noticed that most of the candidates selected for the next round were from Tamil Nadu, and while it may have been coincidence, I felt there may have been some bias β€” especially considering that a few others and I implemented almost the same solutions as some of the selected candidates.

But that’s life β€” sometimes it's about more than just the code.


πŸ“ Final Tips for Future Aspirants

  • βœ… Prepare well for Aptitude – This is the most difficult and most important round.
  • πŸ’» LLD Practice is essential – Go beyond just DSA.
  • ⌨️ Get comfortable with online IDEs – You'll be expected to code in them during interviews.
  • πŸ’ͺ Stay consistent and positive – Even if it doesn't work out, every experience counts.

πŸ“ A Note on the Journey

I travelled 600 km for this drive with a lot of hopes, and though it didn’t go as planned, I’m taking this as a valuable experience. To anyone out there grinding β€” your day will come too. Just keep showing up. πŸ™Œ


Feel free to ask me if you have questions about the process. Good luck to all future Zoho aspirants! πŸš€

Interview Questions (7)

Q1
Validate BST
Data Structures & AlgorithmsMedium

Given the root of a binary tree, determine if it is a valid binary search tree (BST).

Q2
Longest Substring Without Repeating Characters
Data Structures & AlgorithmsMedium

Given a string s, find the length of the longest substring without repeating characters.

Q3
Check Palindrome
Data Structures & AlgorithmsEasy

Given a string or number, determine if it is a palindrome.

Q4
First Missing Positive
Data Structures & AlgorithmsHard

Given an unsorted integer array nums, find the smallest missing positive integer.

Q5
Substrings with Exactly K Distinct Characters
Data Structures & AlgorithmsMedium

Given a string S and an integer K, find the number of substrings of S that contain exactly K distinct characters.

Q6
First Unique Character in a String (1 Pass)
Data Structures & AlgorithmsEasy

Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1. This should be achievable in a single pass.

Q7
Design a Task Manager Application (LLD)
System Design

Design a Task Manager application. This involved starting from basic design, adding persistence using local file storage, and handling multiple edge cases and improving functionality step by step.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!