i
Xoriant
Filter interviews by
I applied via Campus Placement and was interviewed in Nov 2021. There were 4 interview rounds.
Python is a versatile language with a simple syntax and a vast library of modules.
Easy to learn and read
Supports multiple programming paradigms
Large community and extensive documentation
Suitable for various applications such as web development, data analysis, and machine learning
Python is a high-level, interpreted programming language known for its simplicity, readability, and ease of use.
Python is dynamically typed, meaning that variable types are determined at runtime.
Python has a large standard library and a vast collection of third-party libraries.
Python is often used for web development, scientific computing, data analysis, and artificial intelligence.
Python code is typically shorter and ...
Python modules are files containing Python code that can be imported and used in other Python programs.
Modules are used to organize code into reusable and maintainable structures.
Python has a large standard library of modules that can be imported and used.
Third-party modules can also be installed and used in Python programs.
Modules can define functions, classes, and variables that can be accessed by other modules.
Modul...
Python generators are functions that return an iterator and generate values on the fly.
Generators use the 'yield' keyword to return values one at a time.
They can be used to generate an infinite sequence of values.
Generators are memory efficient as they generate values on the fly instead of storing them in memory.
Example: def my_generator(): yield 1; yield 2; yield 3;
Example: for num in my_generator(): print(num)
Python iterators are objects that allow iteration over a collection of elements.
Iterators are used to loop through a collection of elements, one at a time.
They implement the __iter__() and __next__() methods.
The __iter__() method returns the iterator object and the __next__() method returns the next element in the sequence.
Iterators can be created using iter() function or by defining a class that implements the require...
Python has two types of constructors - default and parameterized constructors.
Default constructor has no parameters and is automatically called when an object is created.
Parameterized constructor takes parameters and is used to initialize the object's attributes.
Example of default constructor: def __init__(self):
Example of parameterized constructor: def __init__(self, name, age):
Yes, Python has a destructor called __del__().
The __del__() method is called when an object is about to be destroyed.
It is used to perform cleanup operations before the object is destroyed.
The __del__() method is not guaranteed to be called, so it should not be relied upon for critical cleanup operations.
Python uses automatic memory management through garbage collection.
Python uses reference counting to keep track of memory usage.
Objects with no references are automatically deleted by the garbage collector.
Python also has a built-in module called 'gc' for manual garbage collection.
Memory leaks can occur if circular references are not handled properly.
To delete a file in Python module, use the os module's remove() method.
Import the os module
Use the remove() method to delete the file
Specify the file path in the remove() method
Example: import os; os.remove('file.txt')
Python has several data types including integers, floats, strings, booleans, lists, tuples, dictionaries, and sets.
Integers represent whole numbers, e.g. 5, -10.
Floats represent decimal numbers, e.g. 3.14, -2.5.
Strings represent sequences of characters, e.g. 'hello', 'Python'.
Booleans represent either True or False.
Lists are ordered collections of items, e.g. [1, 2, 3].
Tuples are similar to lists but immutable, e.g. (1...
Variables are containers that store values while literals are values themselves.
Variables can be changed while literals cannot
Variables can be assigned to literals
Literals are used to represent fixed values
Variables are used to represent changing values
Python has five standard data types: Numbers, Strings, Lists, Tuples, and Dictionaries.
Numbers include integers, floating-point numbers, and complex numbers.
Strings are sequences of Unicode characters.
Lists are ordered sequences of values.
Tuples are ordered, immutable sequences of values.
Dictionaries are unordered collections of key-value pairs.
init() method is a constructor method in Python that is called when an object is created.
It initializes the attributes of the object.
It takes self as the first parameter.
It can be used to perform any setup required before the object is used.
It can be overridden to customize the initialization process.
Example: def __init__(self, name, age): self.name = name self.age = age
Global variables are accessible throughout the program, while local variables are only accessible within a specific function.
Global variables are declared outside of any function and can be accessed from any part of the program.
Local variables are declared within a function and can only be accessed within that function.
If a local variable has the same name as a global variable, the local variable takes precedence withi...
Slicing is a way to extract a portion of a sequence (string, list, tuple) in Python.
Slicing is done using the colon (:) operator.
The syntax for slicing is [start:stop:step].
start is the index where the slice starts (inclusive), stop is the index where the slice ends (exclusive), and step is the size of the jump between indices.
If start or stop is not specified, it defaults to the beginning or end of the sequence.
If ste...
Split method splits a string into an array of substrings based on a specified separator. Join method joins the elements of an array into a string.
Split method returns an array of strings.
Join method concatenates the elements of an array into a string.
Both methods are used to manipulate strings in JavaScript.
Example: var str = 'apple,banana,orange'; var arr = str.split(','); var newStr = arr.join('-');
Output: arr = ['ap...
I am familiar with HTML, CSS, and JavaScript for front-end development.
HTML
CSS
JavaScript
The building blocks of object oriented programming are classes, objects, inheritance, encapsulation, and polymorphism.
Classes are templates for creating objects
Objects are instances of classes
Inheritance allows classes to inherit properties and methods from parent classes
Encapsulation is the practice of hiding implementation details from users
Polymorphism allows objects to take on multiple forms
Pass by value copies the value of a variable, while pass by reference copies the address of the variable.
Pass by value creates a new copy of the variable, while pass by reference uses the original variable.
Pass by value is used for primitive data types, while pass by reference is used for objects and arrays.
Pass by value is faster and safer, while pass by reference allows for more efficient memory usage.
Pass by value c...
Operator overloading is the ability to redefine operators for user-defined types. Function overloading is the ability to define multiple functions with the same name but different parameters.
Operator overloading allows user-defined types to use operators such as +, -, *, /, etc.
Function overloading allows multiple functions to have the same name but different parameters.
Operator overloading and function overloading bot...
Joins in SQL are used to combine data from two or more tables based on a related column.
Inner join returns only the matching rows from both tables.
Left join returns all the rows from the left table and matching rows from the right table.
Right join returns all the rows from the right table and matching rows from the left table.
Full outer join returns all the rows from both tables.
Example: Inner join can be used to combi...
Indexes in SQL are used to improve query performance by allowing faster data retrieval.
Indexes are data structures that store a small portion of the table data in an easily searchable format.
Types of indexes include clustered, non-clustered, unique, and full-text indexes.
Clustered indexes determine the physical order of data in a table, while non-clustered indexes create a separate structure for faster searching.
Unique...
Top trending discussions
posted on 21 Nov 2020
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 appeared for an interview in Sep 2019.
I applied via Recruitment Consultant and was interviewed before Jan 2020. There were 5 interview rounds.
I am proficient in Java, Python, and C++. I have 2 years of experience in software development. I have excellent communication skills for client interaction.
Proficient in Java, Python, and C++
2 years of software development experience
Excellent communication skills for client interaction
I applied via Naukri.com and was interviewed before Oct 2020. There were 5 interview rounds.
I appeared for an interview in Sep 2020.
posted on 12 Jul 2021
I applied via Naukri.com and was interviewed before Jul 2020. There were 3 interview rounds.
based on 6 reviews
Rating in categories
Software Engineer
1.7k
salaries
| ₹4.5 L/yr - ₹14.5 L/yr |
Senior Software Engineer
1.7k
salaries
| ₹9 L/yr - ₹33.7 L/yr |
Softwaretest Engineer
623
salaries
| ₹2.5 L/yr - ₹8.7 L/yr |
Technical Lead
622
salaries
| ₹12 L/yr - ₹40 L/yr |
Senior Test Engineer
451
salaries
| ₹9 L/yr - ₹31.5 L/yr |
CitiusTech
HTC Global Services
HERE Technologies
Collabera Technologies