Back to feed
Single Experience
TS
Tarun Santani's profile picture
Interview Experience
Tarun Santani
Arista
SDE
CS 2025
Friday, February 7, 2025
987 reads
2 min read

🎯 Process Overview


📌 Stages:

  • Online Test
  • Technical Interviews: 2 Rounds

📝 Online Test

The test was challenging for many candidates, but familiarity with the Striver DSA Sheet made it manageable.

🔹 Questions:

  • Question 1 (Greedy):
    • An easy greedy algorithm problem.
  • Question 2 (Dynamic Programming):
    • A 1D DP question that was straightforward for those with DP experience.
    • The task was to find the maximum sum in an array with the option to either move sequentially or jump to prime numbers ending in 3.
    • Solution involved memoization and setting up proper logic for jumps based on number properties.
  • Question 3 (Graph):
    • A directed cyclic graph problem.
    • Initially thought to use Kahn’s algorithm due to the *directed nature, but it turned out to be a *simpler DFS-based solution as the graph was cyclic.
    • *Partially solved, achieving **2.5/3 correct solutions, ranking *5th overall.
🔍 Observation: Some candidates were selected despite scoring lower, likely due to diversity and inclusion considerations.

🛠 Interview Rounds

🔹 Technical Interview — Round 1

📄 Resume:
  • The interviewer had reviewed my resume but didn’t ask related questions, as is common with higher-paying companies focusing on skills over resumes in initial rounds.

📝 Questions:

  • C Language Code with Pointers:
    • Required to code using C pointers and memory allocation with malloc and calloc.
    • I requested to use C++ due to syntax familiarity but was asked to proceed with *C, which *impacted my performance.
  • Memory Allocation:
    • Explained static, dynamic, and register memory allocation in C/C++.
    • Follow-up: Discussed the storage of static and constant variables.
  • Linked List:
    • Tasked with reversing a linked list in k-sized parts.
    • *Coded it from scratch, presented **two approaches, though faced *some issues.
  • Copy Mechanisms:
    • Explained shallow copy and deep copy.
💬 Feedback: The interviewer noted that performance on the first question significantly impacted their assessment.

❌ Verdict:

  • Outcome: Not selected.
  • Result: Five candidates were selected, chosen primarily for strong foundational skills.

🔍 Reflection and Advice:

  • Interview Focus: Knowledge of *C language specifics, including **pointers and memory allocation, was *critical in this round.
  • Suggested Prep Areas: Reviewing C syntax, memory management, and pointer usage could strengthen performance in similar high-level technical interviews.

Reads: 987

Shared on theInterview community feed

Related Experiences

Hand-picked interview stories similar to this one.

8 posts