JobsJob TrackerJob alerts

Arista Network · 9 questions

All 9Coding 6System Design 1
  • Insert node in sorted doubly linked listCoding
  • Shortest path between two nodes in a binary treeCoding
  • Synchronization basics
  • Implement printf
  • Modify bit data in O(1)Coding
  • Sort column in a large fileCoding
  • Search in sorted linked list faster than O(n)Coding
  • LRU Cache implementationSystem Design
  • Dynamic mean and medianCoding
← Arista Network questions
  1. Interview questions
  2. Arista Network
  3. Dynamic mean and median
Coding

Dynamic mean and median

Filed under Arista Network

The question

Suggest an approach to find the mean and median of elements as they are dynamically added at runtime.

No write-up yet. Related questions below have one.

Related Arista Network questions

  • Insert node in sorted doubly linked list
  • Modify bit data in O(1)
  • Sort column in a large file
  • Search in sorted linked list faster than O(n)
← LRU Cache implementation

Collected from public candidate posts and coding forums. Updated Nov 2026.