Software Engineer

You are given two strings A and B. Find the index of the first occurrence of A in B. If A is not present in B, then return -1.

For Example:

A = “bc”, B = “abcddbc”.
String “A” is present at index 1, and 5(0-based index), but we will return 1 as it is the first occurrence of “A” in string “B”.

Follow Up:

Can you solve this in linear time and space complexity?

Ninja wants to build a triangle pattern for English alphabets for a given integer input.

Example, for ‘N’ = 4

Pattern:

ABCDDCBA
 ABCCBA
  ABBA
   AA

You have been given a board where there are '2' rows and 'N' columns. You have an infinite supply of 2x1 tiles, and you can place a tile in the following ways:

1. Horizontally as 1x2 tile
2. Vertically as 2x1 tile

Count the number of ways to tile the given board using the available tiles.

Note :

The number of ways might be large so output your answer modulo 10^9 + 7.

Here an example of tile and board for 'N' = 4 :

What are semaphores?
What is virtual memory?
What are acid properties in DBMS?
What is the benefit of ER Diagram?
Define different types of network topology

Introduce yourself.
What are your strengths and weaknesses?
How do you think one can overcome his weaknesses?
How will you react if you are asked to work overtime at the same pay?
How will you handle conflict in your colleagues?