Filter interviews by
I appeared for an interview in Apr 2023.
Yes, string 2 can be created from string 1 by rearranging the characters.
String 2 can be created by rearranging the characters of string 1.
Use sorting or permutation algorithms to rearrange the characters.
Example: String 1 = 'hello', String 2 = 'olleh'
Use a hash set to store elements as you iterate through the array, check if the difference between the target value and current element exists in the hash set.
Iterate through the array and store elements in a hash set
For each element, check if the difference between the target value and current element exists in the hash set
If it does, add the pair to the result array
Use a loop to iterate through the string and count consecutive characters.
Iterate through the string and keep track of the current character and its count.
Append the character and its count to a new string.
Return the compressed string.
Decompress a compressed string to return the original string
Iterate through the compressed string and rebuild the original string based on the characters and their frequencies
Use a stack to keep track of characters and their frequencies while decompressing the string
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 appeared for an interview in Sep 2017.
I applied via Naukri.com and was interviewed before May 2018. There were 5 interview rounds.
I applied via Recruitment Consultant and was interviewed in May 2019. There were 3 interview rounds.
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 appeared for an interview before Nov 2020.
I applied via Naukri.com and was interviewed before Apr 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before Apr 2020. There were 4 interview rounds.
based on 1 interview experience
Difficulty level
Duration
Technical Support Engineer
186
salaries
| ₹3.3 L/yr - ₹6.4 L/yr |
Senior Software Engineer
132
salaries
| ₹16 L/yr - ₹26.6 L/yr |
Security Analyst
122
salaries
| ₹3.5 L/yr - ₹6.1 L/yr |
Software Support Specialist
81
salaries
| ₹3.5 L/yr - ₹6.2 L/yr |
Software Engineer
64
salaries
| ₹5.9 L/yr - ₹13 L/yr |
ITC Infotech
CMS IT Services
KocharTech
3i Infotech