InterviewBit academy

general
41

No, they have their own interface for that.

42

did you use recursion for the 3rd question

43

Nope iteration. Letā€™s a be the larger length string of the two(a and b are the input strings). Swap a and b if a is not longer in length than b.
Then this code should work. This is just a pseudo-code-

int length_a = a.length(), length_b = b.length();
if(length_a < length_b)
	swap(a, b);

int ptr_a = 0, ptr_b = 0;

// find if b is a sub-sequence of a
while(ptr_a < length_a && ptr_b < length_b) {
	if(a[ptr_a] == b[ptr_b])
		++ptr_b;
	++ptr_a;
}

// if all chars in b matches
if(ptr_b == length_b)
	cout << "yes, can pet";
else
	cout << "no, cant pet";
44

Whatever, i havenā€™t received the mail yet, Iā€™m losing hope now :frowning:

45

same dude idk what is happening.

46

How many did you solve

47

They have interviews till 26 th, so donā€™t worry you may get an email soon. Otherwise why not ping them directly and ask if results are still pending for some students?

1 Like
48

Maybe theyā€™re going through the applications in the order they came, i had applied for the course just before the deadline
Iā€™ll ping them by the end of the day when i reach home. Thanks

1 Like
49

Possible, I had applied around a month before or so.

1 Like
50

Hope so
(10 chars)

51

3 and a half

52

You probably get in, you should ping them too. :slight_smile:

53

I checked the website, it says, ā€œCongrats, you have cleared the entrance test. As a next step please select a slot of 30 mins for personal interviewā€, but I didnā€™t receive any mail, Lol, I was worried, anyways, thanks for the support, good luck to all of you.

1 Like
54

What happens when the array is [1, 2, 2, 2, 2, 2], where will the upper bound pointer point at ??

1 Like
55

Didnā€™t know that there is also a case of direct selection .

56

You didnā€™t specify the number N, but lets take both 1 and 2
1-
lower_bound points to 0 and upper_bound points to 1. So, 1 - 0 = 1, and there only 1 instance of 1
2-
lower bound points to 1 and upper bound points to the end of the array that is 6, so 6 - 1 = 5 and there are 5 instances of 2.

1 Like
57

I meant n to be 2, anyways good solution, congrats on your selection!
Hopefully Iā€™ll see you in IBAcademy then

1 Like
58

donā€™t you think the answer for the second question is 3!.5!.3!.6! , if the same type of fruits should be together and duplication is allowed

59

If same type fruit are together itā€™s 3!
Because we think of same fruits together as a single unit, looking at the question i think the examiner means that same type of fruits are idemtical

2 Likes
60

Share your approach for 5th question