JobsJob TrackerJob alerts

AppDynamics ยท 32 questions

All 32Coding 23System Design 1Low-Level Design 4Behavioral 3
  • Minimum jumps across stones with k-1, k, k+1 jump lengthsCoding
  • Real-time metrics monitoring internship, Kubernetes, Calico, BGPBehavioral
  • What do you know about Cisco/AppDynamics and why joinBehavioral
  • Count subsequence of length three in a given stringCoding
  • Minimum flips to convert binary string to all zerosCoding
  • Count substrings containing all five vowelsCoding
  • Maximum profit by buying and selling a shareCoding
  • Heap memory allocation and heapifyLow-Level Design
  • Design synchronized elevator systemSystem Design
  • Delete largest and farthest directory in file systemCoding
  • Sentence Query Matching and Linked List FilteringCoding
  • Print Top View of a TreeCoding
  • Most Challenging Technical TaskBehavioral
  • Minimize array sumCoding
  • Regular bracket sequenceCoding
  • Next inorder successorCoding
  • Design O(1) data structureLow-Level Design
  • Find duplicates in an arrayCoding
  • Find median of multiple (x, y) pointsCoding
  • Count ways to construct target stringCoding
  • Heapify and code implementationCoding
  • Convert Binary Tree to Linked ListCoding
  • Valid parenthesis lengthCoding
  • Find anagrams in a stringCoding
  • Difference Array Range Update Query in O(1)Coding
  • Number of Regions N Lines Divide PlaneCoding
  • Segregate Even and Odd NumbersCoding
  • Check if Each Level of a Binary Tree is PalindromeCoding
  • Design Tic Tac ToeLow-Level Design
  • Implement Mobile Phone Call Logs ListLow-Level Design
  • Internal Implementation of HashMap
  • Convert Decimal to Binary Including Negative NumbersCoding
โ† AppDynamics questions
  1. Interview questions
  2. AppDynamics
  3. Print Top View of a Tree
Coding

Print Top View of a Tree

Filed under AppDynamics

The question

Write code to print the top view of a binary tree.

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

Related AppDynamics questions

  • Minimum jumps across stones with k-1, k, k+1 jump lengths
  • Count subsequence of length three in a given string
  • Minimum flips to convert binary string to all zeros
  • Count substrings containing all five vowels
  • Maximum profit by buying and selling a share
โ† Sentence Query Matching and Linked List FilteringMost Challenging Technical Task โ†’

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