i
Successive Technologies
Filter interviews by
Basics of JS, Node JS. Deep dive in React JS concept
Top trending discussions
posted on 10 Nov 2015
I appeared for an interview before Oct 2020.
Round duration - 40 minutes
Round difficulty - Medium
Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?
Given an array of integers ARR
of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.
Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.
Return the maximum count of 1s obtained by flipping a sub-array at most once.
Round duration - 20 minutes
Round difficulty - Medium
Asked 1 standard algorithm
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.
Mark visited cells to avoid redundant traversal.
Increment island count whenever a new island is encountered.
Tip 1 : prepare for competitive programming
Tip 2 : know about standard algorithm
Tip 3 : must be good with dbms
Tip 1 : must have projects, which you can explain to them
Tip 2 : have things on resume, that you are totally certain about.
Dont't remember the exact questions
I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.
Simple DBMS and DSA Questions
I applied via Campus Placement and was interviewed before Apr 2023. There were 3 interview rounds.
Coding round consisting DSA portion mainly.
I appeared for an interview in Jul 2024.
Leet code medium level question
Hashmap is a data structure that stores key-value pairs and allows for fast retrieval of values based on keys.
Hashmap uses a hashing function to map keys to indices in an array.
It allows for constant time complexity O(1) for insertion, deletion, and retrieval operations.
Example: HashMap<String, Integer> map = new HashMap<>(); map.put("key", 123); int value = map.get("key");
posted on 12 Mar 2025
I appeared for an interview before Mar 2024, where I was asked the following questions.
based on 1 interview
Interview experience
Associate Engineer
191
salaries
| ₹3 L/yr - ₹11.3 L/yr |
Senior Associate Engineer
139
salaries
| ₹5.6 L/yr - ₹17.9 L/yr |
Associate Software Engineer
109
salaries
| ₹3 L/yr - ₹9.4 L/yr |
Desktop Support Engineer
78
salaries
| ₹1.4 L/yr - ₹2 L/yr |
Technical Lead
42
salaries
| ₹10 L/yr - ₹37.6 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions