<iframe src="https://www.googletagmanager.com/ns.html?id=GTM-KVGHS6G" height="0" width="0" style="display:none;visibility:hidden"></iframe>

Uber计算机科学面试真题

职位分类
全部
数据相关
计算机科学
人工智能
产品经理
BQ
面试题
全部(110)
OOD(4)
Algorithm(83)
System Design(10)
高频题(2)
Math(0)
全部(110)
OOD(4)
Algorithm(83)
System Design(10)
高频题(2)
Math(0)
1.实现版本控制功能
2.jumping number
3.判断字符串是否递增
4.leetcode729
5.leetcode564
6.leetcode238
7.leetcode230
8.设计消息系统
9.leetcode16
10.leetcode1428
11.判断是否存在合适的路线
12.leetcode1730
13.实现hash map
14.Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
15.CombinationIterator Class Design for Lexicographical Combinations
16.Rotting Oranges Problem
17.Island Perimeter Calculation
18.Minimum Turns to Open a Combination Lock
19.Kth Smallest Element in a Sorted Matrix
20.Shortest Clear Path in Binary Matrix
21.Closest Palindrome Number Finder
22.shift to sorted array
23."Generate Strobogrammatic Numbers of Given Length"
24."Check if a Number is Strobogrammatic"
25.Top K Frequent Words in Array
26.Decoding Ways of a Numeric String
27.Maximum Path Sum in Binary Tree
28.实现简化版yaml parser
29.Sliding Window Maximum
30.Minimum Number of Conference Rooms Required
31."Check If a Person Can Attend All Meetings"
32.Digital list
33.Number of pairs
34.Fully used batteries
35.前端:点击事件
36.Merging Two Sorted Linked Lists
37.0/1 maze
38.Color range
39.Merge interval
40.Interval List Intersections
41."Merge Overlapping Intervals"
42.Find Minimum in Rotated Sorted Array
43.Random Weighted Index Picker
44."Minimum Number of Buses to Destination"
45.Design a File Relationship and Versioning System
46.MineSweeper
47.Pair threshold
48.Uber eats
49.Evaluate Simple Math Expression
50.Max Frequency Element with K Increments
51.Spiral Matrix Traversal Algorithm
52.Minesweeper Game Update After Click
53.Substring Pairs in Array of Strings
54.Kth Largest Element in a Binary Search Tree
55.Meeting Room Availability
56.Operations on a List with Complexity Constraints
57.Find All Indices in a Matrix Where the Center is the Unique Maximum
58.Forming a Palindrome by Removing at Most One Character
59.Balancing Parentheses
60.Optimization Model for Driver Route Decision
61.Design a Chat Bot
62.Multi-threaded Task Scheduler
63.Longest Valid String with Brackets
64.Process Queries and Count Triples
65.Partition Matrix and Minimize Difference
66.Sort Palindromic Transactions
67.Count Non-Equal Elements
68.Longest Contiguous Houses After Each Build
69.Sum of Digits to Single Digit with Most Occurrence
70.Array Transformation Based on Pivot
71.Rectangle Storage and Fit Operations
72.Calculate Water Flow Distances in a 2D Array
73.Return Palindromic Numbers in Descending Order
74.Find the First Non-Matching Number in an Array
75.Course Schedule Planning
76.Course Schedule Feasibility Check
77.Array Operations with 0s and 1s
78.Diagonal Traverse of a Matrix
79.String Pairs with Same Content or Prefix
80.Audiobook Continuous Playback
81.Version Control System Log Processing
82.Find the Earliest Time for a Meeting Schedule
83.Match Songs with Videos by Duration
84.Calculate the Difference Between Sum of Even-Positioned and Odd-Positioned Numbers
85.Matrix Transformation to Form Letter 'Y'
86.Version Control System Log Analysis
87.String Movement Analysis
88.Board Color Explosion
89.Unix Command Occurrence Count
90.Set Obstacle and Check Block on Infinite Axis
91.Blur Image with Radius
92.Generate a Hollow Square
93.Unix Command Execution Count
94.Determine Final Position
95.Minimum Fare Bus Route Problem
96.Balloon Bursting in a Matrix
97.Find the First Column with a 1 in a Binary Matrix
98.Robot Location Query
99.Adding Edges to Achieve Even Node Degrees
100.Implementing Square Root Calculation using Newton's Method
101.Front-end Implementation Task
102.Robot Movement on a 2D Board
103.Count Distinct Pairs with Equal Elements After Swaps
104.Identify the First Index that Breaks the Odd-Even-Odd Pattern
105.Metric monitor system design
106.Calculator coding problem
107.Factorion Number Calculation
108.Counting Online and Offline Messages
109.Distribute Integers in Vectors
110.Robot Movement Command Interpretation
1. 实现版本控制功能
版本之间有的相容有的不相容。要求实现三个方法,一个是添加新版本,同时输入会告诉我们这个版本和前一个版本是否相容。第二个方法是手动直接让两个版本相容。第三个方法是给定两个版本,确定他们是否相容,返回boolean值。相容性是可以传导的。
2. jumping number
返回N位数以内的所有jumping number。jumping number的定义是任意相邻两个
数字之差为1,如121,123
3. 判断字符串是否递增
给定一个order string(比如dcba),判定input str是否是non-decreasing oder的。比如dxxa返回True,dxxbxxcxxa返回false。Follow-up是inputstr很大的时候,怎么scale
4. leetcode729
leetcode729
5. leetcode564
leetcode564