i
Dream11
Filter interviews by
Different types of testing in STLC lifecycle include unit testing, integration testing, system testing, and acceptance testing.
Unit testing: Testing individual units or components of a software application.
Integration testing: Testing the integration of different modules or components.
System testing: Testing the entire system as a whole.
Acceptance testing: Testing to ensure the system meets the requirements and is read
I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed before Dec 2021. There were 3 interview rounds.
Two task were there . One coding and another related to Testing MCQs
4 dsa problems will be easy to do
DSA on arrays and strings is essential for efficient coding and problem-solving.
Arrays and strings are fundamental data structures in programming.
Knowledge of sorting and searching algorithms is crucial for array manipulation.
String manipulation techniques like substring, concatenation, and comparison are important.
Dynamic programming is a useful technique for solving problems on arrays and strings.
Examples: finding th...
25 basic aptitude asked from train,time and work
2 coding questions which was basic and medium questions
I applied via Campus Placement and was interviewed before Aug 2022. There were 5 interview rounds.
There were 2 questions to test our basic coding knowledge.
Data structures are used in various applications like search algorithms, storage systems, and graph algorithms.
Search algorithms like binary search use arrays and trees for efficient searching.
Storage systems use data structures like hash tables and linked lists for organizing and accessing data.
Graph algorithms like Dijkstra's algorithm use graphs and trees for solving complex problems.
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a hash table to store key-value pairs
Use a doubly linked list to keep track of the order of items
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the back of the list
Lookup and insertion should be O(1) time complexity
Implement 2 stacks in an array
Divide the array into two halves
Use top1 and top2 to keep track of top elements of stacks
Push and pop elements from respective halves
Check for overflow and underflow conditions
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
Questions from trees and linkedin
Reverse a linked list using multiple approaches.
Iterative approach: Use three pointers to reverse the links between nodes.
Recursive approach: Recursively reverse the rest of the list and adjust the links.
Stack approach: Push all the nodes onto a stack and then pop them to create the reversed list.
2 hours coding round, only 1 person out of 90 cleared
I was interviewed before May 2022.
Basic on PHP and Javascript should be clear
Laravel framework based questions
Algo, basic Javascript
based on 2 interviews
Interview experience
Software Development Engineer II
46
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Sde1
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
21
salaries
| ₹0 L/yr - ₹0 L/yr |
My11Circle
Fantasy Akhada
MyTeam11
BalleBaazi