i
Xebia
Filter interviews by
I applied via Naukri.com and was interviewed in Dec 2022. There were 2 interview rounds.
MVC Lifecycle is the sequence of events that occur in the Model-View-Controller architectural pattern.
MVC stands for Model-View-Controller.
The lifecycle starts with a user request.
The controller receives the request and processes it.
The controller updates the model with the necessary data.
The view is then updated with the updated model data.
The updated view is sent back to the user as a response.
Creating Threads in Java
Extending the Thread class and overriding the run() method
Implementing the Runnable interface and passing it to a Thread constructor
Using Executor framework to create and manage threads
Using Callable and Future interfaces to create threads that return values
HashMap is a data structure that stores key-value pairs. List is a collection of ordered elements.
HashMap allows fast retrieval of values based on keys.
List maintains the order of elements and allows duplicates.
HashMap uses hashing to store and retrieve elements.
List uses indexing to access elements.
HashMap is not thread-safe while List is thread-safe.
Example: HashMap<String, Integer> map = new HashMap<>();...
HashMap is a non-synchronized implementation of Map interface while HashTree is a synchronized implementation of Map interface.
HashMap is faster than HashTree as it is non-synchronized.
HashTree is thread-safe while HashMap is not.
HashMap allows one null key and multiple null values while HashTree does not allow null keys or values.
HashTree maintains the order of elements while HashMap does not.
HashMap is generally used...
The class used to connect with the Database depends on the programming language and framework being used.
In Java, the class used is usually DriverManager or DataSource.
In Python, the class used is usually psycopg2 or mysql-connector.
In PHP, the class used is usually PDO or mysqli.
The specific class used may also depend on the type of database being used, such as MySQL, PostgreSQL, or MongoDB.
Classes needed to create a GET REST API
Controller class to handle the request
Service class to perform business logic
Repository class to interact with database
Model class to define data structure
RequestMapping annotation to map the URL
An interface is a blueprint of a class. Default method is a method in an interface with a default implementation.
An interface defines a set of methods that a class must implement
Default method provides a default implementation for a method in an interface
Default methods were introduced in Java 8
Default methods can be overridden by implementing classes
An interface is used to define a contract between two components in a system.
An interface defines a set of methods that a class must implement.
Interfaces are used to achieve abstraction and loose coupling.
Interfaces are used to create reusable code.
Interfaces are used to enable polymorphism.
Interfaces are used in many programming languages, including Java, C#, and TypeScript.
Polymorphism is the ability of an object to take on many forms.
Polymorphism allows objects of different classes to be treated as if they are objects of the same class.
It can be achieved through method overloading and method overriding.
Example: A parent class Animal can have multiple child classes like Dog, Cat, and Cow. All these child classes can have their own implementation of the method 'makeSound', which can be ca...
Top trending discussions
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process
Track the time taken to rot all oranges and return -1 if any fresh oranges remain
Handle edge cases like no fresh oranges or all oranges already rotten
Consider using a queue to efficiently process adjacent oranges
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...
Find the maximum path sum between two leaf nodes in a binary tree.
Traverse the tree to find the maximum path sum between two leaf nodes.
Keep track of the maximum sum found so far.
Consider all possible paths between leaf nodes.
Handle cases where the tree has only a single leaf node.
Implement a recursive function to calculate the maximum path sum.
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
If the given list is (1 -> -2 -&g...
Find the N-th node from the end of a Singly Linked List of integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
You are given a binary tree consisting of distinct integers and two nodes, X
and Y
. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other or when one node is the LCA itself.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.
Split the input string by spaces to get individual words
Reverse the list of words
Join the reversed words with a single space in between
Handle leading/trailing spaces by stripping them before and after reversing
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
Sort subjects in descending order
Assign subjects to friends one by one until all subjects are assigned
The maximum workload will be the sum of problems assigned to the friend with the most problems
Return the maximum workload as the minimum time required
Grammar in compiler design defines the syntax and structure of a programming language.
Grammar specifies the rules for forming valid statements in a programming language.
It consists of a set of production rules that define how valid programs can be constructed.
There are different types of grammars such as context-free grammar, regular grammar, etc.
Example: In C programming language, the grammar specifies that a for loop...
A token in compiler design is a basic unit of syntax that the compiler can understand and process.
Tokens are the smallest units of a program that are meaningful to the compiler.
Examples of tokens include keywords, identifiers, operators, and punctuation symbols.
Tokens are generated by the lexical analysis phase of the compiler.
Tokens are used by the parser to build the abstract syntax tree of the program.
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current path sum to the total sum when reaching a leaf node
Use modulo (10^9 + 7) to handle large outputs
A regular language is a language that can be recognized by a finite automaton.
Regular languages can be described by regular expressions.
Regular languages are closed under union, concatenation, and Kleene star operations.
Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.
NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.
NP problems can be verified in polynomial time but not necessarily solved in polynomial time.
NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.
Examples of NP problems include the subset sum problem and the traveling salesm...
Round duration - 30 minutes
Round difficulty - Easy
That was the round for which I’ve been waiting for hours
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.
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 applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.
Convert given no to corresponding excel no.
Excel no starts from 1 and goes up to 16384
Excel no is calculated using column and row numbers
For example, 1 corresponds to A, 27 corresponds to AA, 28 corresponds to AB, and so on
Find unique characters in a window of k size in a string.
Use a sliding window approach.
Maintain a hash table to keep track of character frequency.
Remove characters from hash table as the window slides.
I applied via Naukri.com and was interviewed in Jun 2021. There were 3 interview rounds.
posted on 30 Nov 2024
I applied via LinkedIn and was interviewed before Nov 2023. There were 2 interview rounds.
1 dsa , aptitude questions
posted on 29 May 2024
Spring Boot is a framework that simplifies the development of Java applications by providing pre-configured settings and tools.
Spring Boot eliminates the need for manual configuration by providing defaults for most settings.
It allows developers to create stand-alone, production-grade Spring-based Applications.
Spring Boot includes an embedded Tomcat, Jetty, or Undertow server, making it easy to deploy web applications.
I...
DP, Binary Search, Greedy, etc
posted on 12 Jun 2024
posted on 4 Sep 2024
I applied via Naukri.com and was interviewed before Sep 2023. There were 4 interview rounds.
3 coding question i have to code on a platform. Need good knowledge of DSA to solve these.
based on 1 interview
Interview experience
based on 7 reviews
Rating in categories
Senior Consultant
678
salaries
| ₹10.5 L/yr - ₹33 L/yr |
Lead Consultant
423
salaries
| ₹12 L/yr - ₹46 L/yr |
Consultant
389
salaries
| ₹5.9 L/yr - ₹20 L/yr |
Principal Consultant
164
salaries
| ₹20 L/yr - ₹48.3 L/yr |
Senior Software Engineer
135
salaries
| ₹8.6 L/yr - ₹32 L/yr |
Xoriant
CitiusTech
HTC Global Services
HERE Technologies