JobsJob TrackerJob alerts

Zepto · 15 questions

All 15Coding 8System Design 3Low-Level Design 3Behavioral 1
  • Binary Search Tree to Greater Sum TreeCoding
  • Maximum Product SubarrayCoding
  • Design DB schema for UberLow-Level Design
  • Best Time to Buy and Sell Stock IICoding
  • Rotting OrangesCoding
  • Quick Commerce Customer Orders and Deliveries SystemSystem Design
  • Authentication and Design Patterns ImplementationLow-Level Design
  • Design Google CalendarSystem Design
  • Insert Nodes into Circular Linked ListCoding
  • Letter Combinations of a Phone NumberCoding
  • Design a Social Media BackendSystem Design
  • First and Last Occurrence of an Element in sorted arrayCoding
  • Find missing binary string of length NCoding
  • Design an e-commerce application with stock management and couponsLow-Level Design
  • Indexing, ACID, CAP theorem and resume metrics discussionBehavioral
← Zepto questions
  1. Interview questions
  2. Zepto
  3. Binary Search Tree to Greater Sum Tree
CodingEasy-MediumReported in a candidate post, Jul 2025

Binary Search Tree to Greater Sum Tree

Filed under Zepto

The question

Transform a given Binary Search Tree into a Greater Sum Tree.

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

Related Zepto questions

  • Insert Nodes into Circular Linked List
  • First and Last Occurrence of an Element in sorted array
  • Find missing binary string of length N
Maximum Product Subarray →

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