SWE Intern

Given an integer n, we must find the number of 1's in the first n number of the magical string. A string is a magical string if concatenating the number of contiguous occurrences of characters '1' and '2' generates the string itself.

Given a binary string, we are allowed to perform 2 operations in any sequence on it.

1 - Remove the character at the start of the string and append it to the end.

2 - Pick any character in the string and flip its value, if its value is '0' it becomes '1' and vice-versa.

We have to return the minimum number of type-2 operations we need to perform such that the string becomes alternating.~ A string is alternating if no two adjacent characters are equal. (like "101", "10101")

The problem is to reverse a string with minimum time complexity and explain all possible solutions.

Explain about Joins in SQL.
Write queries to apply each join on two tables like student and department.

Describe the pillars of OOPs. (Learn)
Explain about abstract class and interface. (Learn)
Explain about static class and non-static class. (Learn)

Explain polymorphism with examples.
Describe constructors and their types.
How can we say there is function overloading?
Can we access non-static members from a static class and vice-versa?

Explain SQL and stored procedures in SQL. (Learn)
Describe view and their types. (Learn)

You are given a string 'S'. Your task is to check whether the string is palindrome or not. For checking palindrome, consider alphabets and numbers only and ignore the symbols and whitespaces.

Note :

String 'S' is NOT case sensitive.

Example :

Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.

Tell me about yourself.
How was your interview experience?
What are your weak points and how I overcame them?