Increff interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Increff
upvote
share-icon
2 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I applied to Increff through on-campus placements. This company came to our college in the second week of the august and it was the first company where I got the chance to sit for the interviews after my resume got selected
Application story
I applied to Increff through on-campus placements in second week of August month . This was the 1st company in which I got the chance to sit for the interviews
Why selected/rejected for the role?
I was selected to this role because I gave all the interviews rounds with confidence and almost gave answers to all the technical questions asked by the interviewer in all rounds and also I was very interactive througout the interviews
Preparation
Duration: 6 months
Topics: I prepared Data Structures and Algorithms and problem solving through many coding platforms like Leetcode, Codeforces, Codechef etc. I also prepared for computer science fundamentals like Operating System, DBMS, Computer Networks, OOPs and basics of system design (LLD and HLD)
Tip
Tip

Tip 1 : Prepare data structures and algorithms along with problem solving 
Tip 2 : Prepare atleast two projects to have some knowledge of development
Tip 3 : Be confident while giving the interviews

Application process
Where: Campus
Eligibility: above 7.5 CGPA
Resume Tip
Resume tip

Tip 1: Don't put irrelevent information in your resume for the sake of filling the page 
Tip 2: Have 2 or 3 good projects and put only the technoligies and programming languages to which you are really confident.

Interview rounds

01
Round
Medium
Video Call
Duration60 minutes
Interview date8 Aug 2022
Coding problem2

The interview was scheduled at 10:00 AM

1. Longest Palindromic Substring

Moderate
20m average time
80% success
0/80
Asked in companies
MicrosoftCIS - Cyber InfrastructureGartner

You are given a string 'str' of length 'N'.


Your task is to return the longest palindromic substring. If there are multiple strings, return any.


A substring is a contiguous segment of a string.


For example :
str = "ababc"

The longest palindromic substring of "ababc" is "aba", since "aba" is a palindrome and it is the longest substring of length 3 which is a palindrome. 

There is another palindromic substring of length 3 is "bab". Since starting index of "aba" is less than "bab", so "aba" is the answer.
Problem approach

First I gave the bruteforce approach to the problem whose time complexity was N^3 then inteviewer asked to optimise it. 
My optimised approach: 
Step-1: Iterate through the string and for each index find the longest palindromic substring whose middle element is ith character by two poonter approach
Step-2 : Also for even length possible palindrome find the longest palindrome taking ith and (i+1)th character as two middle elements 
Step-3: Update your ans everytime you get the larger palindrome

Try solving now

2. Find All Triplets With Zero Sum

Moderate
30m average time
50% success
0/80
Asked in companies
MicrosoftFacebookDunzo

You are given an array Arr consisting of n integers, you need to find all the distinct triplets present in the array which adds up to zero.

An array is said to have a triplet {arr[i], arr[j], arr[k]} with 0 sum if there exists three indices i, j and k such that i!=j, j!=k and i!=k and arr[i] + arr[j] + arr[k] = 0.

Note :
1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then (2, -3, 1), (-3, 2, 1) etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".
Problem approach

Step-1: Sort the array nums and iterate over the array
Step-2 : Use nums[i] as the pivot element.
Step-3: Now create two pointers low and high, where low is positioned at i+1 and high at the end of the array i.e.) n-1.
Step-4: If the triplet (nums[i], nums[low], nums[high]) sums upto 0, sort the triplet and push it in ans vector.
to make sure no duplicate triplet is pushed in the answer vetor, decrease high and increase low until you have reached another distinct element.
Step-5: If the triplet sums to greater than 0, decrease the high pointer.
Step-6: If the triplet sums to less than 0, increase the low pointer.
Step-7: To maintain distinct pivot elements, increase i till it reaches the next distinct element.

Try solving now
02
Round
Easy
Video Call
Duration60 minutes
Interview date8 Aug 2022
Coding problem3

Interview was scheduled at 2:00 pm and I was alone in the room
Interviewer was very humble and supportive
This was basically a system design round but interviewer asked about my hobbies, projects and also some questions from OS and DBMS

1. Design Question

Design a Lift using oops concept

Problem approach

Tip 1: First understand the requirements of the problem 
Tip 2: Don't think of the best solution immediately as you cannot design the lift and make all required classes at one go
Tip 3: Following are the some necessary classes in the lift design: 
Class ExternalRequest (Requested floor, directionToGo)
Class InternalRequest (Destination floor)
Class Elevetor (direction, current state, current floor)
Enum Direction (UP, DOWN)
Enum State (IDLE, MOVING, STOPPED)

2. OS Question

What is the difference between process and a program

Problem approach

Tip 1: Give your answer confidently 
Tip 2: Give answer to the point only 
Answer: 
Process is an instance of an executing program. For example, we write our computer programs in a text file and when we execute this program, it becomes a process which performs all the tasks mentioned in the program.
Program is a set of instructions to perform a certain task. Eg: chrome.exe, notepad.exe

3. DBMS Question

What are ACID properties

Problem approach

Tip 1: First give abbreviation for each character in ACID
Tip 2: Then explain each properties seperately 

Answer: 
Atomicity: By this, we mean that either the entire transaction takes place at once or doesn’t happen at all.

Consistency: This means that integrity constraints must be maintained so that the database is consistent before and after the transaction.

Isolation: This property ensures that multiple transactions can occur concurrently without leading to the inconsistency of the database state.

Durability: This property ensures that once the transaction has completed execution, the updates and modifications to the database are stored in and written to disk and they persist even if a system failure occurs.

Here's your problem of the day

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

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
960 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6450 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3451 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
15480 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
15338 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
10142 views
2 comments
0 upvotes