PPK(outdated)
1. Delete certain integer from array
int[] massiv={};
int b = 5;
int count = 0;
for (int i : massiv) {
if (i == b)
count++; }
int[] temp = new int[massiv.length - count];
int x = 0;
for (int j = 0; j < massiv.length; j++) {
if (massiv[j] != 5)
temp[x++] = massiv[j];
2. Find the longest numbers sequence (for example out of array
[1111223344] -> sequence of number 1)
int[] massiv = {};
int count = 1;
int result = 0;
int number = -1;
for (int i = 1; i < massiv.length; i++) {
if (massiv[i] == (massiv[i-1])) {
count++;
} else { count = 1;}обновляем, если цифра поменялась
if (result <= count) {
annaabi.ee 
