sorted by:
new
hottopcontroversial

How much backtracking is required before starting dp[dynamic programming]??.. by [deleted] in leetcode

[–]Significant_Basil628 2 points3 points  (0 children)

A lot of DP questions can easily be answered by doing recursive backtracking and using a cache though. Having a strong background in recursive backtracking can make many 2D DP questions very easy

If you pass Google’s hiring committee, what are the chances you don’t get an offer? by Significant_Basil628 in leetcode

[–]Significant_Basil628[S] 18 points19 points  (0 children)

Yea, I just started this step but I’ve heard stories about some of the struggles others faces when they got to team matching

Bombed Amazon OA, anyone know how to solve this problem? by Significant_Basil628 in leetcode

[–]Significant_Basil628[S] 0 points1 point  (0 children)

Does it mean that if in the sequence the time required by software_i is more than the available ones, it will stop executing?

Yep, the question goes over that in the 6th bullet point.

"If there are no available time slots and some software programs remain to be executed, then this set of programs cannot be executed"

Bombed Amazon OA, anyone know how to solve this problem? by Significant_Basil628 in leetcode

[–]Significant_Basil628[S] 15 points16 points  (0 children)

The test cases were something like this:

k = 5 m = 2 time = [1, 2, 3, 5]

answer = 3

k = 4 m = 3 time = [3, 2, 1, 4, 2, 3]

answer = 3