Contribute OA Coins
NewOA CalendarViewOA GroupsJoin
OAHelperbyNxtWave

Community

Interviews

OA StorePricing
Log inStart free
U

Urban Company

Software Engineer

Interview Date

May 2024

Result

Not Specified (Implied Selected)

Difficulty

Medium

Rounds

3 rounds

Drive Type

Off-Campus (Applied through LinkedIn)

Interview Date

May 2024

Result

Not Specified (Implied Selected)

Difficulty

Medium

Rounds

3 rounds

Drive Type

Off-Campus (Applied through LinkedIn)

Topics asked

Data StructuresAlgorithms (Greedy)Entity ModelingLow-Level DesignOOPs (Runtime Polymorphism)Database Indexing (BTreesAVL Trees)Database ShardingConsistent Hashing AlgorithmSQL queries

Detailed experience

Role: Software Engineer

College: Not Specified

Interview Date: May 2024

Interview Type: Off-Campus (Applied through LinkedIn)

Result: Not Specified (Implied Selected)

Difficulty: Medium

Rounds: 3 rounds

Topics Asked: Data Structures, Algorithms (Greedy), Entity Modeling / Low-Level Design, OOPs (Runtime Polymorphism), Database Indexing (B+ Trees, AVL Trees), Database Sharding, Consistent Hashing Algorithm, SQL queries

Experience:

The candidate applied through LinkedIn and received a call from a Tech Lead, who discussed previous internships, tech stack, role details, and team. HR then scheduled the interview rounds.

Round 1: DSA
This was a DSA round with two standard LeetCode medium difficulty questions. One specific question mentioned was "Fruit Baskets," approached with a Greedy algorithm, aiming for O(N) time complexity and O(1) space complexity.

Round 2: Entity Modeling / Low-Level Design (LLD)
The interviewer asked to design a Query Management System with functionalities like resource utilization monitoring, notification, and analytics. The tip given was to discuss thoughts and try to use design patterns.

Round 3: Technical/Managerial Round
This round included various technical questions:

  • Explain Runtime Polymorphism and give real-world examples (with code).
  • Define Database indexing, how it is stored on disk, and B+ Trees (how they are used in indexing, dry run sequence to draw B+ Tree for values).
  • AVL Trees and their self-adjusting property.
  • Database Sharding and its drawbacks.
  • Consistent Hashing Algorithm.
  • Write a SQL query (Standard Join Query).

Posted on - 13 Nov 2025

Summarise with AI

  • ChatGPT
  • Claude
  • Perplexity
  • Grok
  • Google AI Mode
Your next OA is closer than you think.Real questions from this season's OAs
ProductCompany OAsAll ProblemsOA CalendarMock OAsDSA RoadmapSQL RoadmapAgent Engineering
ResourcesInterview experiencesTopicsOA GroupsContributeCompany InsightsOA StorePremiumFor Colleges
OA Helper, powered by NxtWave
TermsPrivacyRefundsTrust & SafetyContact© 2026 OA Helper

Disclaimer: OAHelper is an independent educational platform. We (oahelper.in) do not own the images or questions shown. Content is uploaded by users.