Orbitax Bangladesh Limited
| Founding year | |
| Company Website | https://www.orbitax.com/ |
| Career Website | |
| Technologies Used | Java, JavaScript, Android, PHP |
Coding Round Questions
You are given an HTML string. Your task is to determine the number of characters encompassed by each HTML tag in the string. For each tag, count the number of characters that are enclosed between the opening () tags.
A tag is composed of one or more lowercase English letters (a-z). For example: <div> ... </div>, <span>..</span>. It can be followed by digits (0-9) i.e <h1>..</h1>.
The content between the tags can consist of:
- English characters (a-z, A-Z).
- Digits (0-9).
- Punctuation marks: period (.), comma (,), and spaces(' ').
Note: When a character is encompassed by a same tag multiple times, count only once for that tag. A tag can have 0 characters. In that case don't print that tag. Spaces(' ') between the tags are not counted.
You are given a string S of length N and an integer K. Your task is to find the total number of subsequences in S that match the pattern P = "orbitaxian", where the difference in position between every consecutive character in the subsequence is no more than K.
More formally, let the subsequence of P be represented by an array pos, where (1 ≤ pos[i] ≤ N) and S[pos[i]] = P[i]. Then for each i > 1, the condition pos[i] − pos[i-1] ≤ K must hold.
The result should be returned modulo 10^9+7
You are given an array of weights of length 200 and 3 buckets. The sum of total weights of the array will not exceed 100. You need to distribute the weights among the buckets such that the maximum value of the difference between the sum of weights in any two bucket is minimum.