|All-time Popular Problems|
|Inorder Successor in BST|
|Maximum Product Subarray|
|Is Binary Number Multiple of 3|
|Pairwise swap elements of a linked list by swapping data|
|Largest Number formed from an Array|
|Reverse an Array|
|Boundary Traversal of binary tree|
|Leaders in an array|
Given a string of digits “0-9”. The task is find the number of substrings which are divisible by 8 but not by 3.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains an integer N denoting the length of the numeric string.
The second line of each test case contains the numeric string.
Print the answer for each testcase in a new line.
1<= T <=100
1<= N <=10000