i
Sasken
Filter interviews by
I applied via Naukri.com and was interviewed in Sep 2021. There were 3 interview rounds.
Functional pointers program
Use pointers to pass functions as arguments
Function pointers can be used to implement callbacks
Function pointers can be used to implement polymorphism
I applied via Naukri.com and was interviewed before Feb 2022. There were 4 interview rounds.
Basic aptitude test plus programming questions.
I applied via Company Website and was interviewed in Oct 2021. There was 1 interview round.
I applied via campus placement at Mumbai University and was interviewed in May 2021. There were 4 interview rounds.
Sasken interview questions for popular designations
I applied via Approached by Company and was interviewed before Feb 2022. There were 4 interview rounds.
Coding, maths, logical ability, graphs
Get interview-ready with Top Sasken Interview Questions
I applied via Campus Placement and was interviewed in Jul 2021. There were 4 interview rounds.
I applied via AmbitionBox and was interviewed in Aug 2021. There were 3 interview rounds.
Basic coding aptitude
JavaScript and python relevant codings
I applied via Campus Placement and was interviewed in Aug 2021. There were 2 interview rounds.
Basic aptitude test.
Reverse a linked list
Iterative approach: Traverse the list and change the pointers to reverse the list
Recursive approach: Recursively reverse the rest of the list and change the pointers
Use a stack to push all the nodes and then pop them to create a reversed list
Stack is a data structure that follows Last In First Out (LIFO) principle.
Stack can be implemented using arrays or linked lists.
Push operation adds an element to the top of the stack.
Pop operation removes the top element from the stack.
Peek operation returns the top element without removing it.
Stack overflow occurs when the stack is full and push operation is performed.
Stack underflow occurs when the stack is empty and
Queues are a data structure that follows the FIFO principle.
Queues can be implemented using arrays or linked lists.
Enqueue adds an element to the end of the queue, while dequeue removes an element from the front.
Peek returns the element at the front of the queue without removing it.
Queues are used in scheduling, buffering, and breadth-first search algorithms.
I applied via Approached by Company and was interviewed before Sep 2021. There were 4 interview rounds.
Questions related to Aptitude and Coding will be asked in first round.
Top trending discussions
Some of the top questions asked at the Sasken interview -
The duration of Sasken interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 65 interviews
Interview experience
based on 494 reviews
Rating in categories
Software Engineer
310
salaries
| ₹3.2 L/yr - ₹12 L/yr |
Senior Software Engineer
269
salaries
| ₹5.4 L/yr - ₹20 L/yr |
Senior Engineer
192
salaries
| ₹6 L/yr - ₹22 L/yr |
Associate Software Engineer
179
salaries
| ₹4 L/yr - ₹6 L/yr |
Lead Engineer
165
salaries
| ₹9.8 L/yr - ₹34 L/yr |
LTIMindtree
Persistent Systems
L&T Technology Services
TCS