Citadel SWE intern OA

第一题签到题，第二题滑动窗口


1. Write a function:
int solution(vector<int> &A);
that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A.
For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5.Given A = [1, 2, 3], the function should return 4.
Given A = [−1, −3], the function should r

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

lueof (j-i+ 1)i.e. the
length of the chosen subarray.

Given, n=3, team a=[5,2, 4, 1]and team b=[3, 6,2, 2] max(j-i+1) is 3 because team_a[1]=2, team_b[2]=2, and team_b[3]=3 can form non-decreasing subarray

感谢分享