Skip to content

[REFACTOR] [Hacker Rank] Interview Preparation Kit: Arrays: New Year … #283

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Mar 1, 2025
Merged

[REFACTOR] [Hacker Rank] Interview Preparation Kit: Arrays: New Year … #283

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 6 additions & 2 deletions ...cises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/NewYearChaos.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,6 +13,8 @@ public class NewYearChaos {
private NewYearChaos() {}

static final String TOO_CHAOTIC_ERROR = "Too chaotic";
static final int NEW_YEAR_CHAOS_TOLERANCE = 2;


/**
* minimumBribesCalculate.
Expand All @@ -25,11 +27,13 @@ public static Integer minimumBribesCalculate(List<Integer> q) {
for (Integer value : q) {
int position = i + 1;

if (value - position > 2) {
if (value - position > NEW_YEAR_CHAOS_TOLERANCE) {
throw new IllegalStateException(TOO_CHAOTIC_ERROR);
}

List<Integer> fragment = q.subList(Math.min(Math.max(value - 2, 0), i), i);
List<Integer> fragment = q.subList(
Math.min(Math.max(value - NEW_YEAR_CHAOS_TOLERANCE, 0), i), i
);

for (Integer k : fragment) {
if (k > value) {
Expand Down