Stigentech it service private limited interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Stigentech it service private limited
1 rounds | 3 Coding
problems
Rejected
Interview preparation journey
Journey
My journey started at my college when I first learned to code. From there onwards, I have done a lot of practice from leet code to code studio. I have maintained a streak of doing at least 50 questions a week to maintain my accuracy.
Application story
This company visited to my campus for the placement. We just had to upload resume and filled all details in the form.
Why selected/rejected for the role?
I was rejected because I was not able to answer all the questions confidently hence I think I did not qualify.
Preparation
Duration: 3 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
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: Above 7 CGPA
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
Video Call
Duration45 minutes
Interview date21 Feb 2023
Coding problem3
Technical round with questions on DSA and OOPs.
1. Reverse Linked List
Moderate
15m average time
85% success
0/80
Asked in companies
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Problem approach
One way is to use recursion to reverse the list. Divide the linked list in two halves, the first node and the rest of the list. Reverse the second half using recursion and append the first half, that is the first node at the end of the reversed linked list. Return the head of the reversed linked list.
2. DS based Question
What is an array?
3. OS Question
What is the difference between high level language and low level language?
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 | 7 problems
Interviewed by OYO
Selected 
4656 views
0 comments
0 upvotes
Java Developer
2 rounds | 3 problems
Interviewed by Stigentech it service private limited
Rejected
874 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6450 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3451 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
Selected 7873 views
1 comments
0 upvotes
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
Selected 9972 views
1 comments
0 upvotes
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
Selected 4309 views
1 comments
0 upvotes