Aristocrat Full Stack Developer Interview Questions and Answers

There were questions of basic aptitude

Q1. Introduce yourself
Add your answer
Q2. About my projects
Add your answer
Q3. What is Radix sort
Ans. 
Radix sort is a non-comparative sorting algorithm that sorts integers by processing individual digits.
• Radix sort works by sorting numbers based on each digit's value, starting from the least significant digit to the most significant digit.

• It can be implemented using counting sort or bucket sort as a subroutine.

• Radix sort is efficient for sorting integers with a fixed number of digits, like phone numbers or social secur
Answered by AI
Add your answer

Q1. 2 DSA questions was asked and Java Questions
Add your answer

Q1. Questions on Kafka, Scalability
Add your answer

Q1. Questions releated to past projects and Cassandra
Add your answer

Q1. Some C++ 14/17 questions and OOPs concepts
Add your answer
Q2. DSA questions based for basic game logics.
Add your answer

Q1. Advanced OOPs and C++ questions
Add your answer
Q2. DSA coding questions based on Stacks and Linked list
Add your answer

Q1. Called me to Noida for a F2F HR round. I wasn’t given any Travel allowance. CTC negotiation was brutal. They were not willing to give me even a 5% hike on my previous salary.The HR and the Team said they’d...read more
Add your answer
Q2. A month passed by. Sometimes they’d say the technical team who took your interview wasn’t available so that the CTC discussion could be further done. And somedays they’d just delay by saying we’d get back ...read more
Add your answer
Q3. After a month of wasting my time. The HR finally called and said they rejected me based on the CTC. And are not even willing to negotiate because of my not so well performance in the technical rounds.
Add your answer

10 reasoning questions and 3 coding questions

Q1. Wap for factorial with recurrsion
Ans. 
Factorial calculation using recursion in a programming language
• Define a function that takes an integer as input

• Base case: if input is 0, return 1

• Recursive case: return input multiplied by factorial of input-1

• Example: factorial(5) = 5 * factorial(4) = 5 * 4 * factorial(3) = ... = 5 * 4 * 3 * 2 * 1 = 120
Answered by AI
Add your answer
Q2. Opps and basic core Java questions
Add your answer

One hour aptitude test based on the mathematics ,logical reasoning.

Q1. One basic question on the language you know and one SQL is asked
Add your answer
Q2. SQL query questions
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

The first round was scheduled in the evening time.
First of all interviewer introduced himself and after my introduction 
He directly shoot first DSA question. The question was easy but conceptual. I have solved some question with same concept and he ask me to share the screen and code in online compiler. Finally I was able to get correct output with all the use cases and I was like "Half work done!"
Then he asked me very core concepts of JavaScript along with that Some Output based questions.
Then finally he asked me theory questions on React along with my experience in React. 
The interviewer was very helpful as well as polite. I don't think if he will not help me during interview I could crack the interview

Q1. 
Is the Sentence a Pangram?
Ninja is relocating to a place called NinjaGram, and for school admission, he is required to identify if a given sentence is a pangram. Your task is to assist Ninja in determini...read more
Ans. 
Step 1 : I have used hashing concept to map occurrence of english alphabet.
Step 2 : I used Counter array with size 26 to find count of every alphabet. 
Step 3 : Traverse the array and if it's panagram append the output string with 1 else 0
Answered Anonymously
Add your answer

Q1. 4 Coding question to be solve live
Add your answer