Filter interviews by
Green Energy and it's adavantages
I applied via Naukri.com and was interviewed in Dec 2020. There were 3 interview rounds.
Top trending discussions
I appeared for an interview in Nov 2020.
Round duration - 60 minutes
Round difficulty - Easy
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...
Implement a function to find the shortest distance between two vertices in a weighted, undirected graph.
Use Dijkstra's algorithm to find the shortest path between the given vertices.
Create a graph data structure to represent the weighted, undirected graph.
Handle cases where no path exists between the given vertices by returning -1.
Optimize the algorithm to handle multiple queries efficiently.
Consider edge cases such as...
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Merge Sort is a divide-an...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively
Sort the two halves separately
Merge the sorted halves to produce a fully sorted array
Time complexity of Merge Sort is O(n log n)
Example: Input - [5, 2, 9, 1, 5], Output - [1, 2, 5, 5, 9]
You are provided with an N * N
maze where a rat is positioned at starting cell MAZE[0][0]
. The goal is to determine and print all possible paths that the rat can take to r...
Given an N * N maze with binary values, find and print all possible paths for a rat to reach the destination cell.
Use backtracking to explore all possible paths from the starting cell to the destination cell.
At each cell, check if it is a valid move (within bounds and not blocked), then recursively explore all four directions.
Keep track of the path taken so far and mark the cells accordingly.
Once the destination cell i...
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
I applied via Company Website and was interviewed before Nov 2022. There were 4 interview rounds.
3 questions in 3 hr, topics were Dp, Strings, Tree
1hr durations 40 questions, main topics were patterns, profit loss, work man , etc.
I applied via Naukri.com
I am a software engineering student with a passion for coding. Here is a code to find repetitive characters in a string.
Iterate through the characters in the string and store their occurrences in a HashMap.
Check the HashMap for characters with occurrences greater than 1 to find repetitive characters.
Return the repetitive characters as an array of strings.
I applied via Company Website and was interviewed in Nov 2021. There were 4 interview rounds.
I applied via Job Fair
Aptitude on clocks, calenders, boats and streams..
Aptitude based on clocks, calendars, boats and streams..
I applied via Company Website and was interviewed in Apr 2024. There was 1 interview round.
based on 1 interview
Interview experience
based on 53 reviews
Rating in categories
Graphic Designer
11
salaries
| ₹1.5 L/yr - ₹4 L/yr |
ART Teacher
6
salaries
| ₹3.3 L/yr - ₹4.2 L/yr |
Game Developer
6
salaries
| ₹3.5 L/yr - ₹4 L/yr |
Program Coordinator
5
salaries
| ₹3.3 L/yr - ₹3.8 L/yr |
Teacher
5
salaries
| ₹2.5 L/yr - ₹2.5 L/yr |
Arena Animation
Maya Academy of Advanced Cinematics
Zee Institute of Creative Arts
Frameboxx Animation & Visual Effects