i
doodleblue innovation
Filter interviews by
I applied via Naukri.com and was interviewed in Jun 2024. There were 3 interview rounds.
Theya give me a task with MERN Development
I applied via Naukri.com and was interviewed in Aug 2023. There were 4 interview rounds.
doodleblue innovation interview questions for designations
I applied via LinkedIn and was interviewed before Oct 2023. There were 2 interview rounds.
20 mins coding problem test
I applied via Recruitment Consultant and was interviewed in Aug 2020. There was 1 interview round.
Optimizing SQL queries involves proper indexing, minimizing joins, and using efficient query patterns.
Use indexes on columns used in WHERE, JOIN, and ORDER BY clauses
Minimize the number of joins and use INNER JOIN instead of OUTER JOIN if possible
Avoid using SELECT * and only select the necessary columns
Use subqueries instead of joins if possible
Use UNION ALL instead of UNION if duplicates are not an issue
Use EXPLAIN t...
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.
based on 7 interviews
1 Interview rounds
based on 29 reviews
Rating in categories
Software Engineer
138
salaries
| ₹3.5 L/yr - ₹13 L/yr |
Senior Software Engineer
129
salaries
| ₹6 L/yr - ₹20 L/yr |
Software Developer
50
salaries
| ₹3 L/yr - ₹12 L/yr |
Front end Developer
35
salaries
| ₹2 L/yr - ₹10.8 L/yr |
Quality Analyst
32
salaries
| ₹2.4 L/yr - ₹8.7 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions