Filter interviews by
Joins are used to combine rows from two or more tables based on a related column between them.
Joins are used in SQL to retrieve data from multiple tables based on a related column between them.
Common types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column;
DML stands for Data Manipulation Language and is used to manipulate data in a database.
DML is used to insert, update, delete, and retrieve data in a database.
Examples of DML statements include INSERT, UPDATE, DELETE, and SELECT.
DML is essential for managing and modifying data within a database.
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:
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.
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...
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...
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...
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...
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 Referral and was interviewed in Jul 2020. There were 3 interview rounds.
I am drawn to Incedo for its innovative approach and growth opportunities, aligning with my career aspirations in technology consulting.
Incedo's commitment to innovation resonates with my passion for technology and problem-solving.
I admire Incedo's collaborative culture, which I experienced in my previous role at XYZ Corp, where teamwork led to a successful project launch.
My future plan includes advancing my skills in ...
I applied via Walk-in and was interviewed before Nov 2020. There were 3 interview rounds.
posted on 16 Sep 2021
I appeared for an interview in Dec 2020.
Round duration - 20 Minutes
Round difficulty - Easy
Given a binary tree, your task is to print the left view of the tree.
The input will be in level order form, with node values separated by a...
Round duration - 45 Minutes
Round difficulty - Easy
It was a technical round held on skype.
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
You are provided with 'K' different arrays/lists, each sorted in ascending order. Your task is to merge all these arrays/lists into one sorted array/list in ascendi...
Merge K sorted arrays into one sorted array in ascending order.
Iterate through all arrays/lists and merge them into one sorted array using a priority queue or merge sort algorithm.
Ensure to handle edge cases like empty arrays/lists or arrays/lists with different sizes.
Time complexity can be optimized by using a min-heap or priority queue to efficiently merge the arrays/lists.
Round duration - 60 Minutes
Round difficulty - Easy
It was also a technical round held on Google meet.
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...
Tip 1 : Maintain detail notes
Tip 2 : Revise the notes
Tip 1 : Mention the skills only which you are aware of
Tip 2 : Improve your resume
posted on 24 Jan 2022
I applied via Campus Placement and was interviewed before Jan 2021. There were 3 interview rounds.
Code to split an array of integers into two subarrays with equal sum.
Iterate through the array and calculate the total sum.
Divide the sum by 2 to get the target sum for each subarray.
Use dynamic programming to find a subset of the array that adds up to the target sum.
Return the two subarrays.
Example: [1, 2, 3, 4, 5, 6] -> [1, 2, 3, 6], [4, 5]
Example: [1, 2, 3, 4, 5] -> [1, 4, 5], [2, 3]
I applied via Company Website and was interviewed in Jun 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed in May 2024. There was 1 interview round.
NAV stands for Net Asset Value, which represents the per-share value of a mutual fund or exchange-traded fund (ETF).
NAV is calculated by subtracting a fund's liabilities from its assets and dividing by the number of shares outstanding.
It is used to determine the price at which investors can buy or sell shares of the fund.
NAV is typically calculated at the end of each trading day.
For example, if a mutual fund has assets...
Custodian banks are financial institutions responsible for safeguarding assets, such as securities and cash, on behalf of institutional clients.
Provide safekeeping of assets
Settle trades on behalf of clients
Collect income on assets
Process corporate actions
Provide reporting and other administrative services
Act as a liaison between the client and the investment manager
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
based on 2 interview experiences
Difficulty level
Duration
based on 4 reviews
Rating in categories
Information Technology Recruiter
274
salaries
| ₹2.1 L/yr - ₹5.4 L/yr |
Software Engineer
265
salaries
| ₹4.2 L/yr - ₹9.5 L/yr |
Technical Recruiter
261
salaries
| ₹2 L/yr - ₹6 L/yr |
Senior IT Recruiter
241
salaries
| ₹3.5 L/yr - ₹7.7 L/yr |
Senior Technical Recruiter
219
salaries
| ₹3.7 L/yr - ₹7.8 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant