Охват к подписчикам
1,9%
ERR
Реакции к просмотрам
0,01%
5 на 28 постов
Пересылки к просмотрам
0,07%
28
Постов в день
0,4
всего 28
Где отзываются чаще
доля реакций к просмотрам- 2 авг.import java.util.*; class Main { public static int solve(int N, String colors, int[] neededTime) { long answer = 0; int i = 0; while (i < N) { int j = i; while (j + 1 < N && colors.charAt(j + 1) == colors.charAt(i)) j++; int len = j - i + 1; if (len >= 2) { long keep = 0; long diffuse = neededTime[i]; for (int k = i + 1; k <= j; k++) { long newKeep = diffuse; long newDiffuse = Math.min(keep, diffuse) + neededTime[k]; keep = newKeep; diffuse = newDiffuse; } answer += Math.min(keep, diffuse); } i = j + 1; } return (int) answer; }0,11%
- 1 авг.без подписи0,11%
- 1 авг.без подписи0,10%
- 14 авг.Accenture Hiring For Python Role Batch Eligible:- 2022 to 2026 Apply Link :- https://www.accenture.com/in-en/careers/jobdetails?id=ATCI-5704900-S2062039_en0,00%
- 13 авг.NTT Data is hiring for Technical Graduate Trainee Apply Now:- https://www.jobseekers19.com/2026/08/nttdata-for-hiring.html0,00%
- 12 авг.𝐊𝐏𝐌𝐆 is hiring Position: Consultant Qualification: Bachelor’s/ Master’s Degree Experienc e: 0-2 (Years) Location: Bangalore/ Gurgaon Apply Now:- https://www.jobseekers19.com/2026/08/is-hiring.html0,00%
- 9 авг.Qualcomm is hiring for Associate Software Engineer Salary: 10-20 LPA Apply here: https://www.jobseekers19.com/2026/08/qualcomm-is-hiring-for-associate.html0,00%
- 6 авг.Apply Now:- https://www.jobseekers19.com/2026/08/ntt-data-is-hiring.html0,00%
- 4 авг.Wipro Hiring Graduate Engineer Trainee Graduation Year: 2024 / 2025 / 2026 Salary: 3.2 LPA Location: Noida Apply Now:- https://www.jobseekers19.com/2026/08/wipro-hiring-graduate-engineer-trainee.html0,00%
- 2 авг.Mastercard Hiring Software Engineer: Graduation Year: 2022 / 2023 / 2024 / 2025 Salary: 16 LPA Location: Pune Apply Link: https://careers.mastercard.com/us/en/job/MASRUSR281108EXTERNALENUS/Software-engineer0,00%
- 2 авг.без подписи0,00%
- 2 авг.import java.util.*; class Main { public static int solve(String word1, String word2) { int n = word1.length(); int m = word2.length(); final int INF = 1_000_000; int[][][] dp = new int[n + 1][m + 1][2]; for (int i = 0; i <= n; i++) { for (int j = 0; j <= m; j++) { dp[i][j][0] = INF; dp[i][j][1] = INF; } } dp[n][m][0] = 0; dp[n][m][1] = 0; for (int i = n; i >= 0; i--) { for (int j = m; j >= 0; j--) { for (int p = 0; p < 2; p++) { if (i == n && j == m) continue; int ans = INF; if (i < n) { ans = Math.min(ans, 1 + dp[i + 1][j][p ^ 1]); } if (j < m) { ans = Math.min(ans, 1 + dp[i][j + 1][p ^ 1]); } if (i < n && j < m) { char c = word1.charAt(i); if (p == 1) { c = (char) ('a' + (c - 'a' + 13) % 26); } if (c == word2.charAt(j)) ans = Math.min(ans, dp[i + 1][j + 1][p]); else ans = Math.min(ans, 1 + dp[i + 1][j + 1][p]); } dp[i][j][p] = ans; } } } return dp[0][0][0]; }0,00%