Quick Overview

This collection evaluates proficiency in string processing (longest palindromic substrings), graph connectivity and union‑find style concepts for 2D point clustering, dynamic connectivity for incremental grid updates, numeric methods using binary search for roots, and recursive parsing/evaluation of nested arithmetic expressions.

Solve Several Algorithm Problems

Company: Uber

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Quick Answer: This collection evaluates proficiency in string processing (longest palindromic substrings), graph connectivity and union‑find style concepts for 2D point clustering, dynamic connectivity for incremental grid updates, numeric methods using binary search for roots, and recursive parsing/evaluation of nested arithmetic expressions.

Loading…