Technical Consultant

In this problem, You are given a string S of digits, such as S = "123456579", we can split it into a Fibonacci-like sequence [123, 456, 579]. Formally, a Fibonacci-like sequence is a list F of non-negative integers such that:

1: 0 <= F[i] <= 2^31 - 1, (that is, each integer fits a 32-bit signed integer type);

2: F.length >= 3;

3: and F[i] + F[i+1] = F[i+2] for all 0 <= i < F.length - 2.

Also, note that when splitting the string into pieces, each piece must not have extra leading zeroes, except if the piece is the number 0 itself.

Return any Fibonacci-like sequence split from S, or return [] if it cannot be done.

Example :

Input: "123456579"
Output: [123, 456, 579]

Explanation:
Since 123 + 456 = 579, therefore the given string can be broken into fibonacci sequence

What is your achievement appart from academics?

Print the following pattern

Pattern for N = 4

The dots represent spaces.

Vuram Questions:
1) Self introduction 
2) areas of interest 
3) sql statements
4) coding- c program to print values of array which when multiplied is greater than 20
5) real world examples of networking protocols

1)Family background 
2)Companies attended before vuram