Filter interviews by
Clear (1)
I applied via Indeed and was interviewed in May 2024. There were 3 interview rounds.
This test was conducted in MSG browser and it has around 30 questions and around 3 to 5 are related to coding
Our topic of discussion is future of jobs and take the first initiative and don't go off topic and try to agree and add points with the fellow members
Experienced Java Developer with a passion for creating efficient and scalable solutions.
Over 5 years of experience in Java development
Strong knowledge of object-oriented programming principles
Proficient in Spring framework and Hibernate
Experience with RESTful web services and microservices architecture
Familiar with Agile development methodologies
Yes, Node.js is a JavaScript runtime built on Chrome's V8 JavaScript engine.
Node.js is used for server-side scripting and building scalable network applications.
It allows developers to use JavaScript for both client-side and server-side development.
Node.js has a large ecosystem of open-source libraries and frameworks like Express.js.
It is commonly used for building real-time web applications, APIs, and microservices.
I applied via Naukri.com and was interviewed in Mar 2022. There was 1 interview round.
Java 8 features include lambda expressions, streams, and functional interfaces. Spring Boot is a framework for building web applications.
Java 8 introduced lambda expressions for functional programming
Streams allow for efficient processing of large data sets
Functional interfaces enable the use of lambda expressions
Spring Boot simplifies the process of building web applications
It includes embedded servers, auto-configura...
Brillio interview questions for designations
Top trending discussions
posted on 21 Mar 2015
I was interviewed before Aug 2016.
I was interviewed in Apr 2017.
I am a software developer with a passion for coding and problem-solving. My family is supportive and has always encouraged my career in tech.
Experienced software developer
Passionate about coding and problem-solving
Supportive family that encourages my career in tech
I was interviewed in Jul 2017.
Autoboxing is the automatic conversion of primitive data types to their corresponding object wrapper classes.
Autoboxing is useful when working with collections that require objects instead of primitives.
Example: int i = 5; Integer j = i; //autoboxing
Unboxing is the opposite of autoboxing, where an object of a wrapper class is converted back to its corresponding primitive type.
Example: Integer j = 5; int i = j; //unboxi
Typecasting up and down refers to converting a variable of one data type to another data type of higher or lower precision.
Typecasting up involves converting a variable of lower precision to a variable of higher precision, such as converting an int to a double.
Typecasting down involves converting a variable of higher precision to a variable of lower precision, such as converting a double to an int.
Typecasting can resul...
To iterate a map in Java, use a for-each loop or an iterator.
Use the entrySet() method to get a set of key-value pairs
For-each loop: for(Map.Entry
Iterator: Iterator
Use hasNext() and next() methods to iterate through the map
Types of synchronization in Java
Synchronized methods
Synchronized statements
ReentrantLock
Semaphore
CountDownLatch
Access modifiers in method overriding
Access modifiers in the overriding method cannot be more restrictive than the overridden method
The access modifier can be less restrictive or the same as the overridden method
Private methods cannot be overridden
Examples: public method can be overridden by public or protected method, but not by private method
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This was an easy round which went really smooth.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iteratively calculate F(n) using F(n-1) and F(n-2).
Ensure the input N is within the constraints 1 <= N <= 10000.
Example: For N = 5, the 5th Fibonacci number is 5 (1, 1, 2, 3, 5).
Given a positive integer N
, your task is to determine and return all prime numbers less than or equal to N
.
N = 10
2 3 5 7
N = 20
Implement a function to return all prime numbers less than or equal to a given positive integer N.
Create a function that takes a positive integer N as input
Iterate from 2 to N and check if each number is prime
Use a helper function to determine if a number is prime
Return an array of all prime numbers less than or equal to N
A merge join in SQL is a method of combining two sorted datasets by matching corresponding rows based on a specified condition.
Merge join is used when joining two large datasets that are already sorted.
It is more efficient than other join methods like nested loop join or hash join for sorted datasets.
The join condition must be an equality condition.
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.id = table2.i
Round duration - 30 minutes
Round difficulty - Easy
The round went excellent. I really enjoyed it. Just be confident about whatever you answer
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This round went well. Interview depends on your basic knowledge of C/C++.
Given two sparse matrices MAT1
and MAT2
of integers with dimensions 'N' x 'M' and 'M' x 'P' respectively, the goal is to determine the resulting matrix produced by their multipl...
Implement a function to multiply two sparse matrices and return the resulting matrix.
Create a function that takes two sparse matrices as input and returns the resulting matrix after multiplication
Iterate through the non-zero elements of the matrices to perform the multiplication efficiently
Handle the edge cases such as empty matrices or matrices with all zero elements
Ensure the dimensions of the matrices are compatible
Tanmay and Rohit are best buddies. Tanmay gives Rohit a challenge involving an array of N natural numbers. The task is to perform and answer a series of queries on the ...
Count the number of even or odd numbers in a range of an array based on given queries.
Create an array to store the input numbers.
Iterate through the queries and update or count even/odd numbers based on the query type.
Output the count of even or odd numbers for each query of type 1 or 2.
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Senior Engineer
881
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
558
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
258
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Specialist
207
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
188
salaries
| ₹0 L/yr - ₹0 L/yr |
Accenture
TCS
Infosys
Wipro