Goinfluencer.io interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Goinfluencer.io
upvote
share-icon
2 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Journey
It was an on-campus placement, the company visited in June. The first coding round was held, and the shortlisted student received a mail for the next two rounds.
Application story
The organization named GOINFLUENCERS visited the campus for the intern-cum-PPO selections. Links to apply were shared on our email ID, and we registered. Our resume was shortlisted, and we received an email that our test was scheduled for 6 PM. We then took the first coding OA round, and the shortlisted students received an email to appear for two more rounds. A DSA round followed, then resume-based questions, core computer questions, and a final HR round.
Why selected/rejected for the role?
I completed my second DSA round very quickly and got selected for it. The resume and core round focused mostly on my projects, which I worked on in the cloud. I explained each and every part of my projects, and they were happy with the response. Since I worked with Kubernetes and was familiar with the Go language, they were impressed with my answers.
Preparation
Duration: 5 months
Topics: DATA STRUCTURES , OOPS , CLOUD COMPUTING , SYSTEM DESIGN , DP , GREEDY ,GRAPH.
Tip
Tip

Tip 1 : Be strong with aptitude and logical based question for clearing basic OA .
Tip 2 : Strong with the core concepts of dsa like graph, tree and map etc.
Tip 3 : One of the tech stacks like Cloud or Frontend or Backend that is from your choice.

Application process
Where: Campus
Eligibility: ABOVE 7.6CGPA
Resume Tip
Resume tip

Tip 1 : The resume should be a mixture of both DSA and core computer skills.
Tip 2 : They were asking more questions about the Go language; having Go skills can help.

Interview rounds

01
Round
Medium
Online Coding Test
Duration45 minutes
Interview date13 Aug 2022
Coding problem3

The round was mostly conducted using an online compiler, and most of the questions from coding platforms were directly asked. The interviewer was good and was happy with all my answers, so he selected me for the next round.

1. Sort Array of 0s and 1s.

Easy
10m average time
90% success
0/40
Asked in companies
WalmartCapegemini Consulting India Private LimitedCoditas

You are given an array ‘A’ of size ‘N’ containing only 0s and 1s. You have to sort the array by traversing the array only once.

For Example:
For the following array:
[0 1 1 1 0 0 1]

The output should be [0 0 0 1 1 1 1].
Note:
You have to sort the array in place.
Problem approach

So, I suggested using brute force first, where a sorting data structure could be used directly. However, he told me that we need to sort in not O(n). Therefore, I suggested using other sorting techniques like merge sort or quick sort. He then asked me to write pseudocode for merge sort. I wrote the pseudocode, and he was happy and told me to solve the next question.

Try solving now

2. Check If The String Is A Palindrome

Easy
10m average time
90% success
0/40
Asked in companies
IntuitSprinklrCIS - Cyber Infrastructure

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.
Problem approach

So I first said we can take a head and point one more variable to the last node; now, one from the start and one from the end, check if they are the same. If they are, it is a palindrome. Another way is to divide it in half and check if both halves are the same. If they are, then it is a palindrome.

Try solving now

3. Averages Of Levels In Binary Tree

Easy
15m average time
85% success
0/40
Asked in companies
OYOJFrog

You are given an arbitrary binary tree consisting of 'N' nodes numbered from 1 to 'N', and each node is associated with some positive integer value. Your task is to find the average of all the levels in the given tree, i.e you have to find the average of all the node values present on the level, for each level.

Two nodes of a tree are said to be at the same level ‘K’ if both of them are at equal distance( 'K' ) from the 'ROOT' node. The 'ROOT' node is said to be at level 0.

Note :

1. Two nodes may have the same value associated with it.
2. Average of any level is computed as the sum of the values of all the nodes at that level divided by the number of nodes at that level.
3. You will be given the 'ROOT' node of the binary tree.
4. You need to print the floor value for each average. For example,  if the average of node values at some level is 3.5 then you have to print 3.
Problem approach

I just explained the optimal way: we can take a queue and iterate through all its levels one by one, calculate the average of the levels, and put it in a vector. He was happy with my solution.

Try solving now
02
Round
Medium
Video Call
Duration50 minutes
Interview date14 Aug 2022
Coding problem4

It was a resume-based round. All the questions related to tech stack and core computer fundamentals like OOP, COA, DBMS, OS, etc., were asked. He was happy with my answers, so he selected me.

1. Best Time to Buy and Sell Stock

Moderate
20m average time
80% success
0/80
Asked in companies
IntuitOptumOYO

You are given an array/list 'prices' where the elements of the array represent the prices of the stock as they were yesterday and indices of the array represent minutes. Your task is to find and return the maximum profit you can make by buying and selling the stock. You can buy and sell the stock only once.

Note:

You can’t sell without buying first.
For Example:
For the given array [ 2, 100, 150, 120],
The maximum profit can be achieved by buying the stock at minute 0 when its price is Rs. 2 and selling it at minute 2 when its price is Rs. 150.
So, the output will be 148.
Problem approach

So, actually, in this question, we were provided with a profits array. I applied the greedy solution, went through each array independently, and found out from which point we could maximize the profit. After that, we could return the maximum value.

Try solving now

2. DBMS

Explain LEFT JOIN and RIGHT JOIN in DBMS (Learn)

Problem approach

Tip 1 : SQL concept should be cleared.
Tip 2 : NoSQL MongoDB concepts should be given importance.
Tip 3 : Practice SQL queries and a lot of practice is required.

3. OS Question

What is a deadlock in OS? (Learn)

Explain all layers of OSI. (Learn)

What is Linux? Explain its port. (Learn)

What is Round Robin Priority? (Learn)

 

 

4. DBMS

How can we connect database in cloud network?

What are the differences between SQL and NoSQL? (Learn)

Why MongoDB is good compared to SQL database? (Learn)

 

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4898 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
1042 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6638 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3638 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
115096 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
58237 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
35146 views
7 comments
0 upvotes