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

SDE - 1

Hackett Group
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I started my coding journey from the second year of graduation. I asked and consulted seniors on how to start in my career. I started doing DSA. In starting it was not regular but from the seventh semester, I started practicing DSA on regular basis. Meanwhile I also learned Web Development in the last phase of third year. Than, I was ready to apply in different companies.
Application story
My friend texted me about this company visiting our campus and told me some of the important questions and topics for its selection process. I applied and participated in its selection process and luckily most of the questions were from the list of important questions shared by my friend. So, I was lucky here.
Why selected/rejected for the role?
I was confident during the full interview process. Actually, I worked a lot on my communications skills and I think they were the main reasons for me getting par the selection process.
Preparation
Duration: 7 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip
Tip

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application process
Where: Campus
Eligibility: 7 CGPA
Resume Tip
Resume tip

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date13 May 2022
Coding problem2

1. Wildcard Pattern Matching

Hard
50m average time
30% success
0/120
Asked in companies
FreshworksWalmartSamsung R&D Institute

Given a text and a wildcard pattern of size N and M respectively, implement a wildcard pattern matching algorithm that finds if the wildcard pattern is matched with the text. The matching should cover the entire text not partial text.

The wildcard pattern can include the characters ‘?’ and ‘*’

 ‘?’ – matches any single character 
 ‘*’ – Matches any sequence of characters(sequence can be of length 0 or more)
Try solving now

2. Check Bipartite Graph

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

Given a graph, check whether the graph is bipartite or not. Your function should return true if the given graph's vertices can be divided into two independent sets, ‘U’ and ‘V’ such that every edge (‘u’, ‘v’) either connects a vertex from ‘U’ to ‘V’ or a vertex from ‘V’ to ‘U’.

You are given a 2D array ‘edges’ which contains 0 and 1, where ‘edges[i][j]’ = 1 denotes a bi-directional edge from ‘i’ to ‘j’.

Note:
If edges[i][j] = 1, that implies there is a bi-directional edge between ‘i’ and ‘j’, that means there exists both edges from ‘i’ to ‘j’ and to ‘j’ to ‘i’.

For example

Given:
‘N’ = 3
‘edges’ = [[0, 1, 1], [0, 0, 1], [0,0,0]]. 

Try solving now
02
Round
Easy
Face to Face
Duration50 minutes
Interview date21 May 2022
Coding problem2

1. Reverse List In K Groups

Hard
15m average time
85% success
0/120
Asked in companies
SAP LabsSamsungIBM

You are given a linked list of 'n' nodes and an integer 'k', where 'k' is less than or equal to 'n'.


Your task is to reverse the order of each group of 'k' consecutive nodes, if 'n' is not divisible by 'k', then the last group of nodes should remain unchanged.


For example, if the linked list is 1->2->3->4->5, and 'k' is 3, we have to reverse the first three elements, and leave the last two elements unchanged. Thus, the final linked list being 3->2->1->4->5.


Implement a function that performs this reversal, and returns the head of the modified linked list.


Example:
Input: 'list' = [1, 2, 3, 4], 'k' = 2

Output: 2 1 4 3

Explanation:
We have to reverse the given list 'k' at a time, which is 2 in this case. So we reverse the first 2 elements then the next 2 elements, giving us 2->1->4->3.


Note:
All the node values will be distinct.


Try solving now

2. DBMS Question

What are Acid Properties in DBMS?
Define a Relation Schema and a Relation.
What is DML (Data Manipulation Language)?
Explain the functionality of DML Compiler.

03
Round
Easy
HR Round
Duration20 minutes
Interview date30 May 2022
Coding problem1

1. Basic HR Questions

Introduce yourself
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?
Are you willing to relocate?
What do you know about the work culture here in our organisation?

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
SDE - 1
3 rounds | 5 problems
Interviewed by Hackett Group
642 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Hackett Group
639 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Hackett Group
807 views
0 comments
0 upvotes
SDE - 2
3 rounds | 6 problems
Interviewed by Hackett Group
565 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57824 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes