Sigtuple Interview Experience – OffCampus

I applied through a referral and got interviewed at Sigtuple in 2021. The result was positive and I am currently working here in Sigtuple technologies as an SDE-1. I am sharing my interview experience with you all.

Interview experience at Sigtuple

Number of rounds – 4

Round 1

It was a coding round on evalground platform with an enabled microphone and camera. The duration was 3 hours. There were 3 questions.

Q1. Given an array that is sorted but can be rotated around an index in the array. For example, if the array is [5, 6, 1, 2, 3] the index of rotation is 2. If there is an index of rotation, find it.

If there is no index of rotation print -1, i.e. the array is completely sorted.

Q2. Given an array of integers and an integer value, find if there is a triplet in the array whose sum is equal to the given value. If there is such a triplet present in the array, then print the triplet and return true. Else return false. For example, if the given array is {12, 3, 4, 1, 6, 9} and the given sum is 24, then there is a triplet (12, 3, and 9) present in the array whose sum is 24.

Input: The input consists of 3 lines. The first line contains the length of the array, the second line contains a space-separated list of the members of the array, and the third line contains the given sum.

Expected output: The expected output is the boolean result of the search (true/ false, case sensitive) followed by the triplet(sorted in ascending order) if the boolean result is true.

Q3. The diameter of a binary tree is the count of nodes on the longest path between two leaves (A Leaf node has no children) in the binary tree.

Binary Tree with Unique Node Values

For the binary tree in the image above, the diameter would be 7. The corresponding paths are from either 3 to 4 (3->6->7->2->5->9->4) or from 11 to 4 (11->6->7->2->5->9->4)

Input: The input binary tree is represented as follows:

First Line: N, the total count of nodes in the tree

Second Line: ROOT R – This implies that the node R is the root of the tree

Third Line onwards: There are a series of N-1 lines which follow this format shown below.

P L C – This implies that C is a left child of its parent P

P R C – This implies that C is a right child of its parent P

Expected Output: The diameter of the input binary tree

Constraints: N <= 1000; Node values are unique in the binary tree

Round – 2

It was a face-to-face interview on google meet. 

  1. Interviewer asked for an explanation of every single thing that was written on my resume. 
  1. He asked me to share my screen and write a code to reverse a string and then he asked me the time and space complexity of it with proper reason. 
  1. He further gave me a question that has two parts to discuss.

Question 1 – How you will find the most recent 5 apps that you used on your mobile phone. Which data structure will you use in this case?

Question 2 – How you will find the 5 most frequently used apps. Which data structure will you use in this case?

Round – 3

It was a normal discussion round on google meet where the interviewer asked me about my experience in past companies (Internships), Technologies that I have worked on, and explained to me the work that I will be doing in Sigtuple.

Round – 4

It was an on-call interview with HR where he asked me questions like why do you want to join Sigtuple, Why this profile only and then we went on with the salary discussion.

My working experience in sigtuple so far

I would rate 10/10 because of the level and quality of the work that I get to do here. The culture of the company is very good. Sigtuple is an employee-friendly company. I would highly recommend it, there is a lot of learning here, especially for a fresher.

Leave a Comment