i
Sigmoid
Filter interviews by
I applied via Campus Placement and was interviewed before Nov 2023. There were 2 interview rounds.
DFS (Depth First Search) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
DFS is implemented using a stack data structure or recursion.
It starts at a selected node and explores as far as possible along each branch before backtracking.
DFS can be used to find connected components, detect cycles, and solve maze problems.
Example: In a graph with nodes A, B, C, and edges ...
Implement a stack that supports push, pop, top, and retrieving the minimum element in constant time.
Use two stacks - one to store the actual elements and another to store the minimum values encountered so far.
When pushing an element, check if it is smaller than the current minimum and push it to the min stack if so.
When popping an element, check if it is the current minimum and pop from the min stack if so.
Top operatio...
Data Structure and algorithms with a little bit of system design and scaling.
I applied via Naukri.com and was interviewed in Oct 2022. There were 4 interview rounds.
Case around demand forecasting and customer churn
Two easy questions two wasy questions two easy questions two easy questions
I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.
Easy to Medium Leetcode Questions
I have worked on projects involving predictive modeling, natural language processing, and machine learning algorithms.
Developed a predictive model to forecast sales for a retail company
Implemented sentiment analysis using NLP techniques on customer reviews
Utilized machine learning algorithms to classify spam emails
Sigmoid interview questions for popular designations
I applied via Referral and was interviewed in Feb 2023. There were 3 interview rounds.
There is contest hosted on hacker rank?
The interview is on problem solving round. The round is of 1 hours they will ask you medium level gfg data structure questions.
Get interview-ready with Top Sigmoid Interview Questions
I applied via Approached by Company and was interviewed before Nov 2023. There were 2 interview rounds.
It was basic with puzzles and sql
Case study about a pharma company entering a new market, customer segmentation and also past projects discussion.
I applied via LinkedIn and was interviewed before Jun 2023. There were 2 interview rounds.
Basic Multiple choice questions
Check for a loop in a linked list by using two pointers moving at different speeds.
Use two pointers, one moving at a normal speed and another moving at double the speed.
If there is a loop, the two pointers will eventually meet at some point.
Alternatively, use a hash set to store visited nodes and check for duplicates.
I applied via campus placement at National Institute of Technology (NIT), Raipur and was interviewed before May 2023. There were 3 interview rounds.
Easy-level questions were asked. One was for coding up BFS of a tree, another was to implement queue using linked list
Medium level questions were asking related to tree and arrays
I applied via Campus Placement and was interviewed before Mar 2023. There were 2 interview rounds.
I was interviewed in Oct 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Started with basic introduction about myself and then 2 DSA problems to be solved on CodeChef or any IDE of your preference. Interviewer was helpful throughout the interview and helped with syntaxes at one point as well.
Parameters tested -
1. Ability to think of edge test cases.
2. Coding Practices like naming variables and functions properly and using the most suitable access modifiers.
3. Ability to think of time and space complexity and optimise it.
Reaching the correct output was not mandatory but was preferred. Priority to coding practices was given.
You are given an array arr
of length N
. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...
The task is to find the next greater element for each element in the given array.
Iterate through the array from right to left.
Use a stack to keep track of the next greater element.
Pop elements from the stack until a greater element is found or the stack is empty.
If the stack is empty, there is no greater element, so assign -1.
If a greater element is found, assign it as the next greater element.
Push the current element ...
Determine the zigzag level order traversal of a given binary tree's nodes. Zigzag traversal alternates the direction at each level, starting from left to rig...
The zigzag level order traversal of a binary tree is the traversal of its nodes' values in an alternate left to right and right to left manner.
Perform a level order traversal of the binary tree
Use a queue to store the nodes at each level
For each level, alternate the direction of traversal
Store the values of the nodes in each level in separate arrays
Combine the arrays in alternate order to get the zigzag level order tra
Round duration - 60 minutes
Round difficulty - Medium
Started with basic introduction about myself and then 2 DSA problems to be solved on google doc. Interviewer was helpful throughout the interview.
Parameters tested -
1. Ability to think of edge test cases.
2. Coding Practices like naming variables and functions properly and using the most suitable access modifiers.
3. Ability to think of time and space complexity and optimise it.
4. Making it to the correct output.
Reaching the correct output was mandatory in best possible time comlexity.
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q
queries. Each query is represented by an integer Q[i]
, and you must ...
This is a problem where a sorted array is rotated and we need to search for given numbers in the array.
The array is rotated clockwise by an unknown amount.
We need to search for Q numbers in the rotated array.
If a number is found, we need to return its index, otherwise -1.
The search needs to be done in O(logN) time complexity.
The input consists of the size of the array, the array itself, the number of queries, and the q
You are provided with two sorted arrays, arr1
and arr2
, along with an integer k
. By merging all elements from arr1
and arr2
into a new sorted array, your task is to ident...
The task is to find the kth smallest element of a merged array created by merging two sorted arrays.
Merge the two sorted arrays into a single sorted array
Return the kth element of the merged array
Round duration - 40 minutes
Round difficulty - Easy
I was asked to introduce myself and general family background check and then discussion around salary negotiation.
Tip 1 : Practice popular questions from Arrays, Binary Trees, LinkedLists from CodeStudio's Interview Problems
Tip 2 : Make sure you are aware of calculating the time and space complexity for every problem you're coding.
Tip 3 : Prepare through Mock Interviews to practice explaining your approach while solving in an actual interview.
Tip 1 : Describe best of your projects in minimum words. Don't forget to add buzz words like REST APIs/ DB Indexing/ Benchmarking etc if you worked on backend.
Tip 2 : Don't add school achievements like Olympiads or Class Topper in your resume.
Tip 3 : If you've some work experience, put it in a way ,you're marketing yourself. Add terms like 'Created/Owned the Project through entire SDLC'
Tip 4 : Make sure you mention how your work experience actually impacted the company. Or how your self project can be actually useful to end user.
Top trending discussions
Some of the top questions asked at the Sigmoid interview -
The duration of Sigmoid interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 62 interviews
Interview experience
based on 121 reviews
Rating in categories
15-22 Yrs
Not Disclosed
6-10 Yrs
Not Disclosed
12-18 Yrs
Not Disclosed
Software Development Engineer II
85
salaries
| ₹14 L/yr - ₹24.5 L/yr |
Data Scientist
49
salaries
| ₹10.5 L/yr - ₹22.5 L/yr |
Data Engineer
49
salaries
| ₹8.5 L/yr - ₹25 L/yr |
Senior Data Scientist
44
salaries
| ₹17 L/yr - ₹28.9 L/yr |
Software Development Engineer
36
salaries
| ₹13.2 L/yr - ₹20.4 L/yr |
Fractal Analytics
Mu Sigma
Tiger Analytics
LatentView Analytics