SDE - Intern

You are given an integer 'N'. Your task is to print the following pattern for the given N number of rows.

For Example: Pattern for N = 4

1
11
111
1111

You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.

Note:

We cannot use the element at a given index twice.

Follow Up:

Try to do this problem in O(N) time complexity. 

You are given a string 'Str' consisting of 'N' lowercase Latin letters. You have to find the longest substring of the given string without repeating characters.

String ‘B’ is a substring of string ‘A’ if it can be obtained from ‘A’ by deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end.

For Example :

If the given input string is "aabc", then you should return "abc" as the longest substring without repeating characters.

Note :

If there are multiple substrings with the same length, then you should print the substring which comes earlier in the given string. 

For Example :

If the given input string is "abcda", here “abcd” and “bcda” can be the longest unique substring but “abcd” comes earlier in the given string. So we will print “abcd” as the longest unique substring.

You are given string S of length N, and an integer K. Your task is to find the length of the longest substring that contains at most K distinct characters.

You are given a positive integer ‘N’. Your task is to find the total number of ‘1’ in the binary representation of all the numbers from 1 to N.

Since the count of ‘1’ can be huge, you are required to return it modulo 1e9+7.

Note:

Do not print anything, just return the number of set bits in the binary representation of all integers between 1 and ‘N’.