JobsJob TrackerJob alerts

Dolat Capital · 20 questions

All 20Coding 14System Design 1Low-Level Design 3Behavioral 1
  • Linked List ADT with Constant Time MaxCoding
  • Write QuicksortCoding
  • C Storage Classes and Variable ScopeLow-Level Design
  • Silver Rod Wage Puzzle
  • Memory Leak CasesLow-Level Design
  • Intersection Point in Two Linked ListsCoding
  • Parking lot billing systemCoding
  • Number of combinationsCoding
  • Binary tree problemCoding
  • Virtual functions, polymorphism, and operator overloadingLow-Level Design
  • Incremental prefix/suffix string palindrome checkCoding
  • Running average classCoding
  • Parse and update numeric values in a stringCoding
  • Find Missing And Repeating numbersCoding
  • LRU Cache implementationCoding
  • Merge Sort implementationCoding
  • Design a tiny URL or URL shortenerSystem Design
  • C++ Coding AssessmentCoding
  • Core C++, OOPS, Pointers, and DSA DiscussionCoding
  • Standard HR QuestionsBehavioral
← Dolat Capital questions
  1. Interview questions
  2. Dolat Capital
  3. Linked List ADT with Constant Time Max
CodingHard

Linked List ADT with Constant Time Max

Filed under Dolat Capital

The question

Insert and delete integer values in a linked list from one end only, and find the maximum value in the linked list at any point in constant time complexity.

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

Related Dolat Capital questions

  • Write Quicksort
  • Intersection Point in Two Linked Lists
  • Parking lot billing system
  • Number of combinations
  • Binary tree problem
Write Quicksort →

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