Upload Button Icon Add office photos

Filter interviews by

Aristocrat Leisure Interview Questions and Answers

Updated 25 Aug 2024

Aristocrat Leisure Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Feb 2024. There were 3 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Mostly related to the past experiences and situation based.
Round 2 - Aptitude Test 

Asked about personality, pressure handling, leadership qualities, inspiration, hobbies and challenges.

Round 3 - HR 

(1 Question)

  • Q1. Salary negotiation

Technical Lead Interview Questions asked at other Companies

Q1. 1. Explain 5 mins the flow from requirement analysis to production deployment and tools used in the process. 2. What is auto-scaling in a microservices architecture? 3. Difference between micro-service and serverless. 4. If you were going t... read more
View answer (4)

Interview questions from similar companies

Interview Questionnaire 

5 Questions

  • Q1. Six sigma analysis
  • Q2. Quality sampling
  • Q3. Introduction
  • Q4. Why ITC ?
  • Ans. 

    ITC is a leading conglomerate with diverse business operations and a strong focus on sustainability.

    • ITC has a strong presence in multiple industries such as FMCG, hospitality, paperboards, and packaging.

    • The company has a reputation for innovation and sustainability, with initiatives such as e-Choupal and the ITC Green Centre.

    • ITC's commitment to social responsibility and community development aligns with my personal val...

  • Answered by AI
  • Q5. Why not startup ?
  • Ans. 

    I prefer the stability and resources of an established company.

    • I value the security and benefits that come with working for an established company.

    • I enjoy being part of a team and working towards a common goal.

    • I appreciate the opportunity to learn from experienced managers and mentors.

    • I believe that an established company provides more opportunities for career growth and advancement.

    • I am excited about the potential to ...

  • Answered by AI

Interview Preparation Tips

Round: Group Discussion
Experience: ITC usually does case GDs. The cases are fun and pretty interesting. You would be in a group of 8-10 people and you would be given a case on which your group has to come to a conclusion in 30 mins. In our case the GD centred around a village. Where the village was facing a lot many challenges with industries shutting down, people deserting the village etc. And most of them had the root cause to the lack of power. And so the group had to come to a conclusion as to which source of energy would be the best feasible for the village based on certain things that were mentioned there in the case,
Tips: GD there are three tips: - Either start the discussion if you know the topic well. - Or play the role of a moderator and quip in with some important points- Or succinctly summarise all the points everyone mentioned and conclude them in a beautiful way explaining the direction in which the group inclines if you do not have much information on the topic. It is pretty important that the group reaches to a consensus.
Duration: 30 minutes

Round: Interview
Experience: ITC conducts interviews way early on Dec 1. Typically around 6:30 am the interviews start. So I was pretty exhausted by being on a stretch of 3 night outs with MTP report submission, MTP presentation, and then all tests and GDs for companies. On Nov 30th as well the interviews and Gds started and it was going on till Dec 1 5 am for me. Then ITC interview was at 7 am in the morning. Interviewers were 5-7 years experienced people. Questions were related to my internship and some core courses. I answered internship related questions well. Screwed up once on a technical question. Usually they would start with one concept and then grill you in depth to understand your expertise in that.
Tips: - Brush up your core concepts- You should be thorough with your internship stuff

Round: Interview
Experience: The HR interviewers were 25 years experienced. Pretty chill people. Asked me questions around why ITC and why not a startup ? etc.Pretty usual set of questions.
Tips: Be calm. Read 64 interview questions pdf. Usually available on institute LAN

College Name: IIT Kharagpur

Interview Preparation Tips

Round: Resume Shortlist
Experience: Since I got a Pre placement offer through Internship so my experiences will be in accordance to Internship
procedure. Placement procedure is almost the same. They look for decent
pointers. In addition to this they would consider if you have some good
technical background. They look for committed people who have an experience of
working in teams.For this they float a from of their own which has some questions answers of which more of less lies in the resume. There are some HR questions too like Long term goal , Short term goal, SOP, mind over matter (the most catchy one). If you get selected for interview round your interview will be around this form .

Round: Group Discussion
Experience: It was my first GD. There were around 120 people selected for the GD. We were
divided in the groups of 10. As expected my group was very tough as there were
better speakers. We were given a paper containing the situation and options. We
were given a total of 20 minutes which included the time for reading and
understanding the situation. Someone started speaking after around 5-6 minutes
followed by an another guy. Next , I had to dive in as if I would have delayed
I would have ran out of ideas which would have been taken by the others. I
started confidently and as time passed by I was successfully able to convince
the people towards my option or I must say there were no arguments towards my
option. Out of expectation, I cleared this round. Next round was the interview round.
Tips: - GD is all about convincing the junta towards your option.- Never speak when some one else is speaking.- Don't be negative , always give positive statements- Never take name of any person sitting in the room in the GD even if you know him/her- Never point fingers- Sometime GD can become a fish market. Stay out of it and wait
for the right time to speak.

- Don't shout

- Don't be an orator if you are not a good speaker

- Read the paper carefully and jot down the pros and cons of
every option so that you have many points to speak to

- It does not really matter how much did you speak but what you
speak matters, don't panic if you have spoken less during GD. Sometimes giving
1-2 logical statements gets you through.
Duration: 20 minutes

Round: Technical Interview
Experience: Around 35 people were selected for this round. We were told there will be 2 rounds of interviews. I got a call for my Technical interview soon. It was a large room with only 3 of us - myself and the 2 interviewers. They started by greeting themselves and asked me to tell something about me. I started confidently and told them about myself, my birth place, interests, college life, IIT B Racing etc. Then the interview shifted to specific questions. I covered every important point in the resume and explained it in a line or two as the questions went. They seemed impressed as I had Cummins on my resume as I was the only one in my batch who did intern over there. Also, having IIT B Racing played a major role in getting me through. They asked some questions around that and I was able to answer them successfully. I could not answer initial questions completely but was confident in whatever I said. This confidence helped me to answer later questions in a better way and they were quite impressed. Frankly , I did not have any hopes till now that I will get into ITC, so I felt stress free during the interview though it was my first interview. After answering every answer confidently they asked me some questions regarding my hobbies - Cricket mostly. Since I have been a die hard fan of cricket and love to play it, my energy level went to a higher level during this discussion. Finally , they asked do you have any questions for us ? I asked what will be my work profile if I get in. They explained me the profile and I liked it. I requested them to work on some project which will create impact on the company rather than doing some research or paper reading work. They smiled and assured me of that. So, finally this interview ended after around 25 -30 minutes. I was expecting the call for second interview. (People who cleared 1st round only got a chance for second HR interview) but not that soon. It was hardly a minute after my interview got over , a person from behind calls out my name and says "You have a second interview in a minute. Are you Ready for it ?" . I was happy but exhausted. I had no other option and said politely "Yes"
Tips: - Be confident
- Don't give arbit answers if you don't know. They are very knowledgeable people and will easily catch you if you are giving vague answers.
- Don't panic if you are unable to answer some questions. Its perfectly fine . Just say politely you don't know/remember.
- Maintain a positive body language
- Show them that you are willing to work for them for a long period of time. Don't give the slightest intention of leaving the company for any reason.
- You should be able to justify every point in your resume or whatever you write.
- Revise the form before interview , the one ITC asked you to fill in the initial process of selection
- Wear good formals. During my time some people gave interview in Jeans. This does not give a professional look. Also carry a pen.

College Name: IIT BOMBAY

Interview Preparation Tips

Round: Group Discussion
Experience: 1.Case study is based on multiple problem- multiple solution. First decide what will be order of problems to be solved based on there severity since solving one problem might counter affect other problem increasing other problem.  And than give there corresponding solutions. Try to convince whole group about the order of problems. 
2. survival problem based case study is also asked. Try to remember that order of importance of things is based on Water-food-shelter-safety-signal device-any thing promoting movement of survivals (last).
Tips: 1. Try to give logical reasons behind any conclusion. 
2. Try to take group together.
Duration: 25 minutes

Skill Tips: " If from electrical branch make machine a strong point."
Skills: Technical Knowledge
College Name: IIT Roorkee
Motivation: It provides non coding work. it gives you a techno managerial work.

Interview Questionnaire 

6 Questions

  • Q1. Given a Linked list , print yes if it is palindrome else print no
  • Q2. Print the level order traversal of the binary tree in the spiral form
  • Ans. 

    Print the level order traversal of binary tree in spiral form

    • Perform level order traversal of the binary tree

    • Alternate the direction of traversal for each level

    • Use a stack to reverse the order of nodes in each level

    • Print the nodes in the order of traversal

  • Answered by AI
  • Q3. Maximum of all subarrays of size k(Expected Time Complexity O(N). Input : arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6} k = 3 Output : 3 3 4 5 5 5 6
  • Ans. 

    Find the maximum element in each subarray of size k in a given array.

    • Iterate through the array from index 0 to n-k.

    • For each subarray of size k, find the maximum element.

    • Store the maximum elements in a separate array.

    • Return the array of maximum elements.

  • Answered by AI
  • Q4. Given Two sorted array of size size n each. Find the Kth largest element in these two array (Expected Time Complexity Log(n))
  • Ans. 

    To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.

    • Merge the two arrays into a single sorted array using a modified merge sort algorithm.

    • Return the Kth element from the merged array.

  • Answered by AI
  • Q5. Website having several web-pages. And also there are lot many user who are accessing the web-site. say user 1 has access pattern : x->y->z->a->b->c->d->e->f user 2 has access pattern : z->a->b->c->d user 3...
  • Q6. Given two array , one of size m+n and contains m element and other position are empty , 2nd array is of size n and contains n element. both array are sorted , now merge the second array to first one such t...
  • Ans. 

    Merge two sorted arrays into one sorted array with expected time complexity of (m+n).

    • Use a two-pointer approach to compare elements from both arrays and merge them into the first array.

    • Start comparing elements from the end of both arrays and place the larger element at the end of the first array.

    • Continue this process until all elements from the second array are merged into the first array.

  • Answered by AI

Interview Preparation Tips

Round: Test
Duration: 90 minutes

Skills: Algorithm , OS, DBMS, data structure
College Name: NIT BHOPAL

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: Coding questions were comparatively easy. There were three questions.1. Given a string map each character of which to the corresponding digit in a 10 digit mobile phone keypad.2. Don't remember, will add when it comes to my mind.3. Don't remember, will add when it comes to my mind.

Skills: Coding ability, Complete knowledge of working of internet.,
College Name: IIT Bombay

Interview Preparation Tips

Round: Test
Experience: Just 1 online test



Round - I (90 mins)



Online Test conducted @ HackerRank



a. M.C.Qs (Operating System + Aptitude + C Programming Language + Object Oriented Programming)



b. Programming (2 coding questions)The Online Exam started off after a brief Presentation on Amazon.





The MCQs were largely based on Operating System, Data structures and Algorithms, OOP concepts, C language and Aptitude.



Coding Questions



1. Determine whether a Linked List is a palindrome or not.



2. Given few sets of intervals print out the the entire intervals without overlapping , if they overlap then combine them into one.



Eg: Input : (5,7) (1 , 6) (2 ,4) (10 ,14) (8,9)



Output : (1,7) (8,9) (10,14)



Advice: Must solve at least 1 coding question to have a good chance for selection into the next round
Tips: CGPA holds importance because it is basic eligibility criteria for written test and then secondly it increases odds in your favor of your selection more than those with lower CGPA with same interview performance. Prepare a good resume



1. Prioritize your content



2. Put the most important information first (Academic Projects + Internship)



3. Proofread it twice



Advice : Do your best and leave the rest to god

Round: Test
Experience: Round II

2 Coding questions

1. Classic 2-sum problem

2. Given numbers a, b as the seeds for the Fibonacci sequence determine if a third number 'k' is a part of that sequence or not. (Tricky)
Total Questions: 2

Round: Other Interview
Experience: Round III
1. Tell me about yourself
2. Project + Internship Discussion
3. Compress a given string "aabbbccc" to "a2b3c3"
constraint: inplace compression, no extra space to be used
assumption : output size will not exceed input size

Round: Technical Interview
Experience: Round IV
1. Internship Project Discussion (30 mins)
2. Find the largest count of 0s in a row in a matrix of 0s and 1s sorted in an ascending order row-wise.
3. Replicate a tree with random pointers inplace

Round: Other Interview
Experience: Round V
1. Question related to graphs involving concepts of Depth and Height of a tree. (Took a lot of time in solving it ! but finally recognized the pattern)
2. Maximum size square sub-matrix with all 1s
3. Find the median of an infinite series of integers
4. Find the most popular Google searches. (solved it using Trie and Max-Heaps)
2 more questions but can't remember them.Finally after waiting for more than 9 hours the results were announced and I was selected
Tips: Be cool and always ask the interviewer questions at the end of the interview. Explain the interviewer your progress while solving the question so that you both are on the same page + its easier for him to understand. Behavioral and H.R.
Tips
1. Speak clearly and with confidence
2. Always prepare yourself beforehand for some common questions like:
a. Tell me about yourself.
b. Why should I hire you?
c. What are your strengths and weaknesses? (give examples)
d. What is your Dream Company?

General Tips: They judge you purely on the basis of your knowledge and performance during the face to face interviews. The extra curricular activities are not given much consideration as Amazon focuses its recruitment procedure purely on the basis of your Technical Knowledge. Prepare a good resume
1. Prioritize your content
2. Put the most important information first (Academic Projects + Internship)
3. Proofread it twice
College Name: NIT JAIPUR

Interview Questionnaire 

8 Questions

  • Q1. Given a n-ary tree. Devise an algo which determines the position at which the 3rd B is present from the given index in constant time complexity
  • Ans. 

    The algorithm finds the position of the 3rd occurrence of 'B' in an n-ary tree from a given index in constant time complexity.

    • Traverse the n-ary tree using a depth-first search (DFS) algorithm

    • Keep track of the count of 'B' occurrences

    • When the count reaches 3, return the current position

    • If the end of the tree is reached before the 3rd 'B', return -1

  • Answered by AI
  • Q2. Given a dictionary with limited words. Check if the string given to you is a composite of two words which are already present in the dictionary
  • Ans. 

    Check if a given string is a composite of two words from a limited dictionary.

    • Create a hash set of all the words in the dictionary.

    • Iterate through all possible pairs of substrings in the given string.

    • Check if both substrings are present in the hash set.

    • If yes, return true. Else, return false.

  • Answered by AI
  • Q3. Given a single linked list of certain nodes. Switch adjacent nodes. Eg. 1 2 3 4 will be 2 1 4 3
  • Ans. 

    Switch adjacent nodes in a single linked list.

    • Traverse the linked list and swap adjacent nodes.

    • Keep track of previous node to update its next pointer.

    • Handle edge cases for first two nodes and last node.

    • Example: 1->2->3->4 becomes 2->1->4->3.

  • Answered by AI
  • Q4. Given a binary search tree. Traverse only the left sub-tree
  • Ans. 

    Traverse only the left sub-tree of a binary search tree.

    • Start at the root node

    • If the left child exists, visit it and repeat the process

    • If the left child does not exist, return to the parent node

    • Continue until all nodes in the left sub-tree have been visited

  • Answered by AI
  • Q5. Implementation of AVL tree. I told solution in nlogn. He asked me optimize further
  • Q6. Write a program to test whether a string and all strings that can be made using the characters of that string are palindrome or not Input Output mmo True yakak True travel False
  • Q7. Next, I was asked to design an efficient data structure for two lifts in a building of n floors
  • Ans. 

    Design an efficient data structure for two lifts in a building of n floors.

    • Use a priority queue to keep track of the floors each lift is heading to

    • Implement a scheduling algorithm to determine which lift to assign to a new request

    • Consider adding a weight limit to each lift to prevent overloading

    • Use a hash table to keep track of the current location of each lift

  • Answered by AI
  • Q8. Given a Integer, find the maximum number that can be formed from the digits. Input : 8754365 output : 8765543
  • Ans. 

    To find the maximum number that can be formed from the digits of an integer.

    • Convert the integer to a string

    • Sort the characters in descending order

    • Join the sorted characters to form the maximum number

  • Answered by AI

Interview Preparation Tips

Skill Tips: They were looking for really cool coders. High expectation on accurate answers. looking for deep understanding of algorithms and data structures.
Skills: Algorithms, Data structures
College Name: PSIT

Skills evaluated in this interview

Interview Questionnaire 

11 Questions

  • Q1. A String was given with a lot of words in it and I had to reverse all the words
  • Ans. 

    Reverse all the words in a given string

    • Split the string into an array of words

    • Loop through the array and reverse each word

    • Join the reversed words back into a string

  • Answered by AI
  • Q2. A String was given and I have to swap word by word from the beginning to the end
  • Q3. In question 2 when there are ‘n’ in the String whose position shouldn’t get affected during the swapping process
  • Ans. 

    Explaining how to handle 'n' in a string during swapping process

    • Identify the positions of 'n' in the string

    • Exclude those positions from the swapping process

    • Use a temporary variable to swap the characters

    • Ensure the swapped characters are not 'n'

    • Return the modified string

  • Answered by AI
  • Q4. Continuation was when more than 1 ‘n’ occur together
  • Q5. There is a big file containing numbers and we have to sort all of them
  • Ans. 

    We can use any sorting algorithm like quicksort, mergesort, heapsort, etc.

    • Choose the appropriate sorting algorithm based on the size of the file and the range of numbers

    • Implement the chosen algorithm in the programming language of choice

    • Read the numbers from the file into an array or list

    • Apply the sorting algorithm to the array or list

    • Write the sorted numbers back to the file

  • Answered by AI
  • Q6. How to implement word suggestions like that in Eclipse
  • Ans. 

    Word suggestions in Eclipse can be implemented using algorithms like Trie or N-gram models.

    • Use Trie data structure to store the dictionary of words

    • Implement auto-complete feature using Trie

    • Use N-gram models to suggest words based on context

    • Train the N-gram model on a large corpus of text data

    • Combine both approaches for better accuracy

    • Consider user's typing speed and frequency of words for better suggestions

  • Answered by AI
  • Q7. Given 2 integers a and b, the sequence which will be formed is a, b, a+b, a+2b…. i.e Current element = sum of the previous 2 elements. So now given a number k, how to figure out if it lies in the sequenc...
  • Ans. 

    To check if a number k lies in a sequence formed by adding previous 2 elements, start with a=0 and b=1 and iterate until k is found or exceeded.

    • Start with a=0 and b=1

    • Iterate through the sequence until k is found or exceeded

    • If k is found, return true. If exceeded, return false

  • Answered by AI
  • Q8. Given a Binary Tree, if it is a BST or not
  • Ans. 

    Check if a Binary Tree is a Binary Search Tree (BST)

    • A BST has the property that all nodes in the left subtree of a node have values less than the node's value, and all nodes in the right subtree have values greater than the node's value

    • We can traverse the tree in-order and check if the resulting sequence is sorted

    • Alternatively, we can recursively check if each node satisfies the BST property

  • Answered by AI
  • Q9. A stream of numbers are coming and I have to keep track of the kth largest number in it
  • Ans. 

    Keep track of kth largest number in a stream of numbers.

    • Use a min-heap of size k to keep track of kth largest number.

    • For each incoming number, compare it with the root of the heap.

    • If it is larger than the root, replace the root with the new number and heapify.

    • The root of the heap will always be the kth largest number.

  • Answered by AI
  • Q10. Summer Internship Project
  • Q11. Given an Infix expression, how to evaluate its answer
  • Ans. 

    Infix expression can be evaluated using the concept of operator precedence and associativity.

    • Convert the infix expression to postfix expression using stack data structure

    • Evaluate the postfix expression using stack data structure

    • Use operator precedence and associativity rules to determine the order of evaluation

    • Parentheses can be used to override the default order of evaluation

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: 1 Written Test - (20 MCQ + 2 Coding Questions) on HackerRankAmazon visited our Campus on 28th July. In the morning the recruitment process started with the Written Test. It was taken on Hacker Rank which comprised of 20 MCQ Questions followed by 2 Programming Questions. MCQ Questions usually contain questions on C, DBMS, OS, and 4-5 Logical Questions. One should be aware that the Hacker Rank platform keeps record of how much time you have spent on each Question and after spending so much time did you attempt it or not. The 2 Coding Problems were quite easy. Only speed and accuracy was required to crack this round.Written Round Coding Question -1) A Linked List was given and we had to swap the ith node with (n-i+1)th node.2)(given some intervals), merge the common Intervals.I coded both the problems and passed all the test cases of the first question and half of the test cases of the 2nd Question. By the evening the results of the written round were declared and the Interview Process started. I rushed to the Design Centre and while I was arranging my grade sheets and my resume , something totally unexpected happened. One of the Amazon Employees who was also an Alumni of MNIT Jaipur walked up to me and told me that I have done very well in the Written Test and I was ranked 2nd based on the Written Test. He wished me ‘Best of Luck’ and told me to calm down and give my best. Talking to him really motivated me a lot. At the same time I was shocked that he still remembered my name even after an year, as we had talked only for a couple of minutes during my Internship Process in Amazon in which I was among the last 3 Students who went to the final round but was not selected. Apart from the students shortlisted from the written test, Amazon also shortlists around 5-6 more candidates based on their CGPA and some other factors. But it should be noted that at any time during the Recruitment Process, Cumulative scores can be considered.
Tips: CGPA above 8 should definitely be maintained.
Total Questions: 22

Round: Technical Interview
Experience: The Interview Process started with around 25 candidates. I was among the first few with whom the Interview had started which went on smoothly



Questions of Interview Round II –



1) A String was given with a lot of words in it and I had to reverse all the words
2) A String was given and I have to swap word by word from the  beginning to the end.
3) In question 2 when there are ‘n’ in the String whose position shouldn’t get affected during the swapping process
4) Continuation was when more than 1 ‘n’ occur together.



I was asked to code the above, and told them about the time and space complexities. Then he went through my resume and based on my projects he appreciated my interest in OS. and asked me a Question –


You have a large game and a small memory, so how will you play the game.
I told him the concept of Virtual Memory and how it makes it possible to run such a game. Then he asked me whether there is any limit or constraint on the size of the virtual memory. I explained to him if the amount of memory required at any particular moment of time to run the game, itself exceeds the available size in the RAM for the user, then we won’t be able to play. Then he asked “Suppose you have a 4 GB Ram then how much memory will be available to the user and what will happen to the other memory”. I explained that kernel occupies some memory and apart from that page tables and all are also stored in the memory. Then there were some discussions regarding my projects.
Tips: These is some Important stuff which one should not miss while preparing for the interviews :


Languages one should be knowing for Placements:
1) C : For most of the companies
2) C ++ - For Faster coding using Standard Template Libraries and for OOPS Concept3) Java – For some specific companies which are focused on Java


Operating System:
1) Galvin Text Book
2) Video Lectures by Prof. Kamakoti – IIT Bombay (Not available on NPTEL. You can get it from current student of IIT Bombay or take it from me. I have Video Lectures of 2013 Pass out Batch)
3) Good grasp on OS implementation on Linux and Pint OS.
4) Detail Knowledge of How Threading is implemented in JAVA


Computer Networks:
1) Video Lectures by Prof. Sujoy Ghosh – IIT Kharagpur (Available on NPTEL)
2) Good grasp on Linux Networking (Servers and Networking Commands)


DBMS :
1) SQL Queries.
2) Database Implementation in MY SQL (Using B trees)
3) Indexing and Hashing in DBMS
4) Drawbacks of SQL Database
5) No SQL Database – Graph and Document Type Database and how they solve the problems
6) Every minute detail of the Database you have created in your DBMS Project.


Data Structures and Algorithms:
1) Video Lectures on Data Structures by Prof Naveen Garg – IIT Delhi (Available on NPTEL)
2) Video Lectures on Data Structure and Algorithm by Prof. Charles Leiserson and Prof. Erik Demaine - MIT.
3) TextBook – “Data Structures and Algorithms made Easy” by Karumanchi
4) TextBook – “Cracking the Coding Interview” by Gayle Laakmann Founder and CEO, CareerCup.com
5) GeeksforGeeks6) Company Specific Preparation by Practicing Previous Interview Papers


Programming Practices:
1) Codechef or Any other Coding Website: Experience helps to increase your Programming Speed, definitely useful in qualifying Coding Round
2) Standard Template Library in C++ for faster Coding - Hacker Rank Tutorial


Other Stuff to Study:
1) Brain Teasers
2) Design Problems (asked by Companies like Adobe. Detailed Example in Karumanchi Textbook)
3) Logical And Aptitude Preparation – Arun Sharma TextBook
4) HR Interview preparation from Indiabix.com

Round: Other Interview
Experience: Around 17 students were shortlisted. The resumes of students and their academic projects were given importance while shortlisting for this round. It started at around 10PM.



Questions of Interview Round III –



1) There is a big file containing numbers and we have to sort all of them.



I mentioned the approach mentioned in GeeksforGeeks that for example the available RAM for this purpose is 100 MB. So we can break the File in chunks of 100 Mb and bring the chunks in Memory and first sort them individually. Then we can prepare a heap containing first elements from all chunks. And keep extracting min from heap and replace it by next smallest element of the chunk it belongs. Then he asked if the number of chunks being formed here are very large, that is the heap I am preparing won’t fit in 100MB, then what to do. I suggested some further modifications and finally he was satisfied with the solution.



2) How to implement word suggestions like that in Eclipse.



I explained that it can be done using Tree Data Structure or using some sort of multilevel hashing in combination with storing words in sorted form. He asked me time complexities and told me to think of further improvements. He wasn’t completely satisfied and moved onto the next question.



3) Given 2 integers a and b, the sequence which will be formed is a, b, a+b, a+2b….



i.e Current element = sum of the previous 2 elements.



So now given a number k, how to figure out if it lies in the sequence or not.



This Question is not as easy as it looks. Here a and b can be negative or positive so the Generated Sequence can contain all positive or all negative or alternate occurrence of positive and negative element in sequence. So till which point should we generate the sequence and decide that k can or cannot lie in the sequence. I wrote a code but he mentioned few test cases in which my code was failing. After a few modifications I was able to write a satisfactory code solving all the test cases.

Round: Other Interview
Experience: I answered both the questions and also mentioned  solution to kth largest if Deletion operation is also there and if it is not. Then he told me to write the code for Heapify Function. Again there were some discussion regarding my Projects.

Round: Other Interview
Experience: Questions of Interview Round V -
This round started with a detailed discussion about my Summer Internship Project in Wooqer. After that I was asked to introduce myself. Then he asked me -

1) Given an Infix expression, how to evaluate its answer.

I was asked to write the code for it covering all the cases and I was given half an hour to do it. I wrote it in about 15-20 minutes. Interview of 4th Round got over by about 9 PM, and the results were declared by 11PM.
Tips: Amazon mostly focuses on – Tries, Big Data, Hashing, Strings. Apart from my general preparation for the Interview, I had gone through around 60 Amazon Interview Papers available on GeeksforGeeks, so I was totally aware of the kind of Questions I would be facing in the Interview, and prepared myself accordingly. In this year’s Amazon Interviews mostly the questions asked were not directly from GeeksforGeeks. And few questions which were picked directly from GeeksforGeeks, the solution they were expecting for it was better than that mentioned in GeekforGeeks. But to guess such a solution, one should surely be aware of all the existing solutions in GeeksforGeeks.

General Tips: Self Projects have a very high weight age in one's selection because this is one of the many things that distinguishes you from other candidates sitting in the Interview. It also shows your capabilities and your field of Interest. Also, Summer Internship surely matters a lot in Companies like Amazon. There was a very detail discussion of my Internship at Wooqer during the Interview Process at Amazon so be prepared.
College Name: NIT JAIPUR

Skills evaluated in this interview

I applied via Referral

Interview Questionnaire 

6 Questions

  • Q1. Design the most optimal data structures for an LRU cache
  • Ans. 

    Design optimal data structures for LRU cache

    • Use a doubly linked list to keep track of recently used items

    • Use a hash table to store key-value pairs for quick access

    • When an item is accessed, move it to the front of the linked list

    • When the cache is full, remove the least recently used item from the back of the linked list and hash table

  • Answered by AI
  • Q2. Convert a sorted array to balanced binary search tree
  • Ans. 

    Convert a sorted array to balanced binary search tree

    • Find the middle element of the array and make it the root of the tree

    • Recursively construct the left subtree using the left half of the array

    • Recursively construct the right subtree using the right half of the array

    • Repeat until all elements are added to the tree

  • Answered by AI
  • Q3. Reverse a singly linked list in groups of k in­place
  • Ans. 

    Reverse a singly linked list in groups of k in­place

    • Divide the linked list into groups of k nodes

    • Reverse each group of k nodes

    • Connect the reversed groups to form the final linked list

  • Answered by AI
  • Q4. Design the most optimal data structure for storing a word and its meaning. Note that a word could have multiple meanings
  • Ans. 

    Optimal data structure for storing words and their meanings

    • Use a hash table with the word as the key and a list of meanings as the value

    • Each meaning can be stored as a string or an object with additional information

    • Consider using a trie data structure for efficient prefix search

    • Implement a search function that can handle partial matches and synonyms

  • Answered by AI
  • Q5. Write a recursive routine to calculate a ^ n
  • Ans. 

    A recursive routine to calculate a ^ n

    • The base case is when n is 0, in which case the result is 1

    • For any other value of n, the result is a multiplied by the result of a^(n-1)

    • The recursive function should call itself with a^(n-1) as the new input

  • Answered by AI
  • Q6. Design the most optimal data structure for a never ending stream of numbers. It should be optimized for insertion, deletion, searching, finding kth largest and kth smallest
  • Ans. 

    Design optimal data structure for never-ending stream of numbers for insertion, deletion, searching, kth largest and kth smallest.

    • Use a balanced binary search tree like AVL or Red-Black tree for efficient insertion, deletion, and searching.

    • Maintain two heaps, one for kth largest and one for kth smallest.

    • For finding kth largest, use a min heap of size k and for kth smallest, use a max heap of size k.

    • Alternatively, use a...

  • Answered by AI

Interview Preparation Tips

Skills:
College Name: NA

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Aristocrat Leisure Interview FAQs

How many rounds are there in Aristocrat Leisure interview?
Aristocrat Leisure interview process usually has 3 rounds. The most common rounds in the Aristocrat Leisure interview process are Technical, Aptitude Test and HR.

Recently Viewed

INTERVIEWS

Teleysia Networks

No Interviews

DESIGNATION

SALARIES

Light & Wonder

SALARIES

Bigleap Solutions

INTERVIEWS

Rotork Controls

No Interviews

INTERVIEWS

Everi Holdings

No Interviews

INTERVIEWS

Saffron Tech

No Interviews

INTERVIEWS

Cumulus Systems

No Interviews

INTERVIEWS

Mas Callnet

No Interviews

SALARIES

Diesel Locomotive Works

No Salaries

Tell us how to improve this page.

Aristocrat Leisure Interview Process

based on 2 interviews

Interview experience

3.5
  
Good
View more

Interview Questions from Similar Companies

TCS Interview Questions
3.7
 • 10.4k Interviews
Amazon Interview Questions
4.1
 • 5k Interviews
Flipkart Interview Questions
4.0
 • 1.3k Interviews
ITC Interview Questions
3.9
 • 545 Interviews
PVR Inox Interview Questions
4.0
 • 162 Interviews
VST Industries Interview Questions
3.9
 • 12 Interviews
View all

Aristocrat Leisure Reviews and Ratings

based on 26 reviews

4.1/5

Rating in categories

3.4

Skill development

4.0

Work-life balance

3.6

Salary

3.5

Job security

4.2

Company culture

3.2

Promotions

3.6

Work satisfaction

Explore 26 Reviews and Ratings
Technical Lead
17 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

L2 Engineer
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Engineer II
8 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Technical Lead
8 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Aristocrat Leisure with

Delta Corp

4.0
Compare

Mahindra Holidays & Resorts

3.5
Compare

VST Industries

3.9
Compare

Future Lifestyle Fashion

4.2
Compare
Did you find this page helpful?
Yes No
write
Share an Interview