Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Uplers Team. If you also belong to the team, you can get access from here

Uplers Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Uplers Lead Developer Interview Questions and Answers

Updated 12 Oct 2023

Uplers Lead Developer Interview Experiences

1 interview found

Lead Developer Interview Questions & Answers

user image Yogesh Patel

posted on 12 Oct 2023

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. What are design patterns in laravel ?
  • Ans. 

    Design patterns in Laravel are reusable solutions to common problems in software design.

    • Design patterns help in organizing code and improving code reusability.

    • Some common design patterns in Laravel include Singleton, Factory, Repository, and Observer.

    • Singleton pattern ensures that only one instance of a class is created.

    • Factory pattern is used to create objects without specifying the exact class of object that will be ...

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. What are Facades in laravel?
  • Ans. 

    Facades in Laravel provide a simple and convenient way to access classes and services from the container.

    • Facades act as static proxies to underlying classes, allowing easy access to their methods.

    • They provide a clean and expressive syntax for accessing services.

    • Facades are used to access Laravel's core services, such as the database, cache, and session.

    • They can be used to access custom classes and services registered i...

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

Interview Questionnaire 

15 Questions

  • Q1. Reverse a binary search tree in such a manner so that parent child relationship maintained and left child become right child and vice versa
  • Ans. 

    Reverse a binary search tree while maintaining parent-child relationship.

    • Start by swapping the left and right child of each node recursively.

    • Use a depth-first search approach to traverse the tree.

    • Make sure to update the parent-child relationships accordingly.

  • Answered by AI
  • Q2. Find the minimum and maximum element in stack in O(1)
  • Ans. 

    To find min and max element in stack in O(1), we can use an auxiliary stack.

    • Create an auxiliary stack to keep track of the minimum and maximum elements.

    • Push the first element to both the main and auxiliary stack.

    • For each subsequent element, compare it with the top element of the auxiliary stack and push the smaller element to the auxiliary stack.

    • To get the minimum element, simply return the top element of the auxiliary...

  • Answered by AI
  • Q3. Given an array find the next minimum element in array for each element. for example if give array is 4,2,1,5,3 resultant array would be 2,1,-1,3,-1
  • Ans. 

    Given an array, find the next minimum element for each element.

    • Iterate through the array

    • For each element, compare it with the elements on its right

    • Find the minimum element greater than the current element

    • If no such element exists, assign -1

    • Build the resultant array

  • Answered by AI
  • Q4. Given two string A and B . remove each character from string A which occur in B. if a occur 2 times in B remove 2 a from A
  • Q5. Find the median of input stream in minimum time complexcity.(Online algo)
  • Ans. 

    Find median of input stream in minimum time complexity using online algorithm.

    • Use two heaps, one max heap for elements smaller than current median and one min heap for elements greater than current median.

    • Maintain balance between the two heaps by ensuring that the size difference is at most 1.

    • If the size of both heaps is equal, median is the average of the top elements of both heaps. Else, median is the top element of ...

  • Answered by AI
  • Q6. Make copy of a linked list which has two pointer one point to next node and other one point to arbitrary node in linked list
  • Ans. 

    To make a copy of a linked list with two pointers, iterate through the original list and create a new node for each element.

    • Iterate through the original linked list

    • Create a new node for each element

    • Set the 'next' pointer of each new node

    • Set the 'arbitrary' pointer of each new node

  • Answered by AI
  • Q7. If u will access data from a social networking site such as Facebook . suggest some method to remove latency to access data
  • Q8. Given a cordinate system in which there are n points. you have to calculate the m minimum points from some origin point. Suggest a data structure for this
  • Q9. Some question on hash data structure
  • Q10. Given a linked list and some no n . you have to reverse the node of linked list in pair of n. consider all test cases for this
  • Ans. 

    Reverse the nodes of a linked list in pairs of n

    • Iterate through the linked list in pairs of n

    • Reverse the nodes within each pair

    • Connect the reversed pairs together

    • Handle cases where the number of nodes is not a multiple of n

  • Answered by AI
  • Q11. Given a array where the difference between two consecutive element is one. Given a no find that no in array in minimum time complexity
  • Q12. How to check singly linked list is palindrome or not
  • Ans. 

    To check if a singly linked list is a palindrome, reverse the second half and compare it with the first half.

    • Traverse the linked list to find the middle node

    • Reverse the second half of the linked list

    • Compare the reversed second half with the first half to check for palindrome

  • Answered by AI
  • Q13. Given a preorder of binary tree such that in tree each node have either 0 or no childern. and each leaf node is represented by N. construct a tree from this
  • Ans. 

    Given a preorder of binary tree with leaf nodes represented by N, construct the tree.

    • Start by creating an empty stack.

    • Iterate through the preorder list.

    • If the current element is N, create a leaf node and push it onto the stack.

    • If the current element is not N, create a new node and set its left child to the top of the stack.

    • Pop the top of the stack and set it as the right child of the new node.

    • Push the new node onto the...

  • Answered by AI
  • Q14. 14. you have given a string of multiline. you have to print the maximum occupancy word in each line and if there is some capital letter in each line then print each capital letter occupancy and then smal...
  • Ans. 

    The question asks to find the maximum occupancy word in each line of a given multiline string and also count the occupancy of capital and small letters separately.

    • Split the multiline string into individual lines

    • For each line, split it into words

    • Initialize variables to store the maximum occupancy word and its count

    • Iterate through each word and count the occupancy of each letter

    • If the current word has a higher occupancy ...

  • Answered by AI
  • Q15. One question related to password matching you have given some precondition for password then user input some password then you will validate the password with each condition if any one condition failed th...

Interview Preparation Tips

College Name: NA

Skills evaluated in this interview

Interview Preparation Tips

Round: HR INTERVIEW
Experience: Tell me about yourself.Most challenging task.-----://www.geeksforgeeks.org/check-for-balanced-parentheses-in-an-expression/

Small modification in it. Parenthesis pairs are given in a separate list. You have to optimize the problem by suggesting the method you will need to store the pairs.

Round: HR INTERVIEW
Experience: What is the angle between hour and minute hand at 12:15. I said 90’ but corrected myself immediately.So he told me the importance that for huge no of clients this small mistake can create a blunder.He asked me a scenario where I faced this thing and thereby improved the time complexity.Lot of behavioural questions like conflicts with manager, team collaboration etc.

Round: HR INTERVIEW
Experience: -----://stackoverflow.com/questions/20026243/find-2-missing-numbers-in-an-array-of-integers-with-two-missing-valuesHe asked me if have heard of nut and bolt problem. I didn’t so he moved to next question.Given an array. Find the maximum number of groups of size of 2 or 3 that can be formed such that sum of the numbers in group is divisible by 3. No number can be reused.

Round: TECHNICAL INTERVIEW
Experience: Convert an integer to its roman. He asked me to consider cases with integers containing 4 and 9. I didn’t understand properly.He asked me if I I did anything extraordinary apart from my daily work in the office and what challenges I faced -----/

He did not accept this solution and asked me to optimize. This round didn’t go well, so I was not selected.

General Tips: Tips:Solve all the data structures related problems from geeksforgeeks and start practicing to write perfect code for any problem.
College Name: NA

Interview Questionnaire 

23 Questions

  • Q1. 18 questions in 20 minutes (probability, Os ,DSA,c)
  • Q2. In second section 2 programming questions in 30 minutes.(Pruning a binary tree , Cutting a rod so that we can get optimal benefit )
  • Q3. Given array of stock prices get the date of selling and buying so that profit is maximum
  • Ans. 

    Algorithm to find the best buying and selling dates for maximum profit from given stock prices array.

    • Iterate through the array and keep track of minimum price and maximum profit.

    • If current price is less than minimum price, update minimum price.

    • If current price minus minimum price is greater than maximum profit, update maximum profit and buying and selling dates.

    • Return buying and selling dates.

    • Example: [10, 7, 5, 8, 11,...

  • Answered by AI
  • Q4. Print a matrix diagonally . I was told to write the code as question was quite easy . After that we moved on
  • Q5. Frog can jump 1 or 2 steps write the code to find out number of ways to go up to n steps. Discussed the complexity of it with mathematical proof
  • Ans. 

    The code finds the number of ways to reach n steps by jumping 1 or 2 steps at a time.

    • Use dynamic programming to solve the problem

    • Create an array to store the number of ways to reach each step

    • Initialize the array with base cases for 0 and 1 steps

    • Iterate through the array and calculate the number of ways for each step

    • Return the value at the last step

  • Answered by AI
  • Q6. Check for balancing of parenthesis using divide and conquer. Didn’t ask for code just wanted the approach. I solved it with stack. But he just wanted Divide and conquer. After thinking for 15 minutes and o...
  • Q7. There is a dictionary of billion words and there is one method provided String getWord(int index); We can give it index and it will return the String on that index . Now word is given to us we have to find...
  • Q8. After that he moved to Oops concepts asked about abstract classes and interfaces. Also asked when to use interfaces .After that we had discussion on volatile keyword(Asked for program which can show its be...
  • Q9. He told me if there is a class and if we want to use only 3 methods of it so in that case we should use inheritance or not. Asked for other better options
  • Q10. Why are you leaving your company so early
  • Q11. Discussion about project in company and about my college projects as well(It was a deep discussion and I think it can throw us out if we don’t give proper answers)
  • Q12. Replace each node in BST with sum of its greater nodes. I solved it quite easily after that he applied various constraints on it(around 3 or 4). So the problem became quite hard. But after thinking about ...
  • Q13. After that he discussed about n-ary tree and getting the LCA in n-ary tree of n nodes.(Wrote the code for it and discussed complexity)
  • Q14. Advantages and disadvantages of amazon.com
  • Ans. 

    Amazon.com is an online retail giant with a vast selection of products and services.

    • Advantages: Wide selection of products, competitive pricing, fast shipping, convenient shopping experience

    • Disadvantages: Can put smaller retailers out of business, concerns over worker treatment and environmental impact

    • Example: Amazon Prime offers free two-day shipping and access to streaming services like Prime Video and Music

    • Example: ...

  • Answered by AI
  • Q15. How to make a file mutually exclusive on a shared file system
  • Ans. 

    Use file locking mechanisms like flock or lockfile to make a file mutually exclusive on a shared file system.

    • Use flock or lockfile to acquire a lock on the file before accessing it.

    • Release the lock once the operation is complete.

    • Ensure all processes accessing the file use the same locking mechanism.

    • Example: flock /path/to/file -c 'command to execute'

    • Example: lockfile /path/to/file && command to execute && rm -f /path/t

  • Answered by AI
  • Q16. Tell me about yourself
  • Ans. 

    I am a software developer with 5 years of experience in developing web applications using Java and JavaScript.

    • 5 years of experience in software development

    • Proficient in Java and JavaScript

    • Developed web applications

    • Strong problem-solving skills

    • Experience with agile development methodologies

  • Answered by AI
  • Q17. Negative and positive things in you
  • Ans. 

    Positive: Strong problem-solving skills, Negative: Can be overly critical of own work

    • Positive: Strong problem-solving skills - I excel at breaking down complex problems and finding efficient solutions

    • Negative: Can be overly critical of own work - I tend to be perfectionistic and struggle with accepting imperfections

  • Answered by AI
  • Q18. Discussion about projects.(Deep discussion)
  • Q19. Tell me a situation in your current company when you had a failure in doing a task and What you learnt from it
  • Ans. 

    I had a failure in implementing a new feature due to a lack of understanding of the requirements.

    • I was assigned to develop a new feature for our software application.

    • I misunderstood the requirements and implemented the feature incorrectly.

    • During the testing phase, it was discovered that the feature was not functioning as expected.

    • I took responsibility for the mistake and immediately communicated it to my team lead.

    • I wo...

  • Answered by AI
  • Q20. Replace every element in array with its closest maximum element in right. As amortized analysis was involved he asked for mathematical proof
  • Ans. 

    Replace every element in array with its closest maximum element in right.

    • Iterate through the array from right to left

    • Keep track of the maximum element seen so far

    • Replace each element with the maximum element seen so far

  • Answered by AI
  • Q21. Asked to design distributed Hashtable . Discussed pros and cons
  • Ans. 

    Designing a distributed Hashtable and discussing its pros and cons.

    • Distributed Hashtable is a data structure that stores key-value pairs across multiple nodes.

    • Pros include scalability, fault tolerance, and load balancing.

    • Cons include increased complexity, potential for data inconsistency, and slower performance due to network communication.

    • Examples of distributed Hashtable implementations include Cassandra, Riak, and D

  • Answered by AI
  • Q22. How will you resolve conflicts with your manager
  • Q23. How will you resolve conflicts with your team mates

Interview Preparation Tips

Round: Technical Interview
Experience: After 2 days HR called me for 3 F2F interviews.

Round: Technical Interview
Experience: Given array of stock prices get the date of selling and buying so that profit is maximum.- Discussed various approaches Brute force ,Using heaps, Divide and conquer and optimal solution.
For each approach I wrote the code on white paper and they told to trace it out with example. I have to write production level code with all corner cases.

Round: Technical Interview
Experience: After one week HR called me that I have one more round with s/w developer manager so I went back to HYD.

Round: Technical Interview
Experience: After that I came back to Pune. I went through a lot of thinking.After two days I got a call from HR that feedback is very positive and all the interviewers want you in their team.  and I got an offer.

General Tips: I got interviewed for Amazon Hyderabad for SDE1 position . It was for e-commerce platform team.I want to share my experience so that it can help others. I have 7 months of experience but the vacancy was for 1+ year exp. Guys all the logistics were arranged by Amazon (Including flight tickets+Hotelstay+cab+lunch and dinner). It was an amazing experience.
Skills: Algorithm, Coding, probability
College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

18 Questions

  • Q1. Tell me about yourself?
  • Q2. DBMS project discussion
  • Q3. How to merge k sorted arrays of n length and discussion on its complexity?
  • Q4. A question on how to reach to the end of an array based on the values available in the array. Values determine the steps which can be taken forward. complete code for this?
  • Q5. How to identify that if a tree is a bst or not?
  • Ans. 

    To identify if a tree is a BST, check if the inorder traversal of the tree results in a sorted sequence.

    • Perform an inorder traversal of the tree

    • Check if the resulting sequence is sorted in ascending order

    • If yes, the tree is a BST; otherwise, it is not

  • Answered by AI
  • Q6. Discussion about the java project
  • Q7. Shortest path in maze and then discussion on it. Maze was modified into a n-dimension maze. complete code for 2-d maze
  • Q8. Favourite subject and what are you best at
  • Ans. 

    My favorite subject is computer science and I excel in problem-solving and algorithm design.

    • Computer science is my favorite subject because I enjoy coding and creating software applications.

    • I am best at problem-solving, as I have a strong analytical mindset and can efficiently break down complex issues.

    • I excel in algorithm design, as I have a deep understanding of data structures and can optimize code for efficiency.

  • Answered by AI
  • Q9. What is paging. what is virtual memory and discussion on why do we have virtual memory?
  • Ans. 

    Paging is a memory management technique used by operating systems to manage memory more efficiently. Virtual memory is a technique that allows a computer to use more memory than it physically has available.

    • Paging divides memory into fixed-size blocks called pages.

    • Virtual memory allows programs to use more memory than is physically available by temporarily transferring pages of data from RAM to disk.

    • Virtual memory also ...

  • Answered by AI
  • Q10. Inside a system with 4 gb ram OS only uses around 3.2 gb. Why is rest of the memory lying waste?
  • Ans. 

    The remaining memory is not wasted, but reserved for other system processes and applications.

    • The operating system reserves a portion of the RAM for its own processes and functions.

    • The unused memory can be used for caching data, improving system performance.

    • Applications and processes may not require the full amount of RAM at all times.

    • The unused memory can be allocated to other applications when needed.

    • Virtual memory an...

  • Answered by AI
  • Q11. A LONG discussion on implementing a T-9 dictionary in a mobile
  • Q12. An array is given which may be any of the 4 cases a.) completely increasing b.) completely decreasing c.) decreasing then increasing d.) increasing then decreasing. Find max in the array. o(log n) solutio...
  • Q13. No of combinations of moves for knight in chess board are given return total possible positions
  • Ans. 

    Return the total possible positions for a knight on a chess board given the number of combinations of moves.

    • Calculate all possible positions for a knight on a chess board using its unique L-shaped moves.

    • Consider the boundaries of the chess board while calculating the positions.

    • The total possible positions for a knight on a chess board are 64.

  • Answered by AI
  • Q14. Again, Tell me about urself
  • Q15. Little discussion on intern project and then discussion on java project
  • Q16. Multiple requests for storing multiple files on a server. How to keep them mutually exclusive?
  • Ans. 

    Use file locking mechanism to ensure mutual exclusion.

    • Implement file locking mechanism to prevent simultaneous access to files.

    • Use semaphores or mutexes to ensure only one process can access a file at a time.

    • Implement a queue system to handle multiple requests and process them one by one.

    • Use transactional file systems to ensure atomicity of file operations.

    • Implement a timeout mechanism to prevent deadlocks.

    • Consider imp...

  • Answered by AI
  • Q17. Write COMPLETE code for implementing a hash table?
  • Ans. 

    Implementing a hash table in code

    • Choose a hash function to map keys to indices in the table

    • Create an array to hold the values at each index

    • Handle collisions by using a collision resolution strategy

    • Implement methods for inserting, retrieving, and deleting values

    • Consider load factor and resizing the table if necessary

  • Answered by AI
  • Q18. Given a bst. Replace the value in each node with sum of all the nodes which have values greater than the node itself
  • Ans. 

    The given question asks to replace the value in each node of a binary search tree with the sum of all nodes greater than the current node.

    • Traverse the BST in reverse order (right, root, left)

    • Keep track of the sum of all greater nodes encountered so far

    • Update the value of each node with the sum and update the sum

  • Answered by AI

Interview Preparation Tips

General Tips: That was pretty much the interview rounds. Best of luck.
Skills: Algorithm, data structure
College Name: MNIT Jaipur

Skills evaluated in this interview

Interview Questionnaire 

14 Questions

  • Q1. Find next inorder predecessor in bst?
  • Ans. 

    The next inorder predecessor in a binary search tree (BST) is the node with the largest value smaller than the given node.

    • In a BST, the inorder predecessor of a node is the rightmost node in its left subtree.

    • If the left subtree of the given node is empty, then the inorder predecessor is the nearest ancestor whose right child is also an ancestor of the given node.

    • If there is no inorder predecessor (i.e., the given node

  • Answered by AI
  • Q2. Given integer n. Generate all possible paranthesis
  • Ans. 

    Generate all possible parentheses for a given integer n.

    • Use recursion to generate all possible combinations of parentheses.

    • Start with an empty string and keep adding opening and closing parentheses.

    • Keep track of the number of opening and closing parentheses used.

    • Stop recursion when the number of opening and closing parentheses reaches n.

    • Add the generated combination to the result array.

  • Answered by AI
  • Q3. Given a linked list having next and random pointer(random pointer can point any where in the SLL node). Generate copy of this linked list
  • Q4. Given a bt and a 2d matrix M. where M[i,j]=1 if i is ancessostor of j. Initially all elements of M is set to zero. Feed this matrix?
  • Ans. 

    The question asks how to feed a 2D matrix with values based on the given binary tree.

    • Traverse the binary tree and for each node, update the corresponding row in the matrix

    • Use a recursive function to update the matrix values

    • Start with the root node and recursively update its descendants

    • Set M[i, j] to 1 if node i is an ancestor of node j

    • Repeat the process for all nodes in the binary tree

  • Answered by AI
  • Q5. Given a sorted array(array can contain duplicates). Find the first occurance of given key elements in this array
  • Ans. 

    Find the first occurrence of a given key element in a sorted array with duplicates.

    • Use binary search to find the key element.

    • If the key element is found, check if it is the first occurrence by checking the previous element.

    • If the key element is not found, return -1.

  • Answered by AI
  • Q6. Now array is rotated..solve same
  • Q7. Spiral order traversal of bt
  • Ans. 

    Spiral order traversal of a binary tree

    • Use a stack and a queue to traverse the binary tree in a spiral order

    • Start with the root node and add it to the stack

    • While the stack is not empty, pop a node from the stack and add its children to the queue

    • If the stack is empty, swap the stack and queue

    • Repeat until both stack and queue are empty

  • Answered by AI
  • Q8. Given a road network of a city. Each road represents an edge and need atleast one guard at any end of the road to put it in observation. Derive a algorithm to deploy minimum guard s.t that each road have a...
  • Q9. He asked me about my previous projects and how I approched them
  • Q10. Implement queue using stacks
  • Ans. 

    Queue can be implemented using two stacks by maintaining the order of elements.

    • Use two stacks, one for enqueue operation and one for dequeue operation

    • When enqueue is called, push the element onto the enqueue stack

    • When dequeue is called, if the dequeue stack is empty, transfer all elements from enqueue stack to dequeue stack

    • Pop the top element from the dequeue stack and return it as the dequeued element

  • Answered by AI
  • Q11. Edit distance problem (DP)
  • Ans. 

    Edit distance problem is a dynamic programming problem to find the minimum number of operations required to transform one string into another.

    • The problem can be solved using dynamic programming approach

    • The solution involves filling up a matrix of size (m+1)x(n+1)

    • The matrix represents the minimum number of operations required to transform one string into another

    • The operations include insertion, deletion and substitution

    • ...

  • Answered by AI
  • Q12. He asked me some simple c questions like memory allocation, dangling pointer, static etc
  • Q13. Related to projects
  • Q14. Find loop in linked list. Proof of algo
  • Ans. 

    To find a loop in a linked list, we can use the Floyd's cycle-finding algorithm.

    • Initialize two pointers, slow and fast, both pointing to the head of the linked list.

    • Move slow pointer by one step and fast pointer by two steps at each iteration.

    • If there is a loop, the slow and fast pointers will eventually meet.

    • To prove the algorithm, we can use mathematical induction and the concept of tortoise and hare.

  • Answered by AI

Interview Preparation Tips

General Tips: I am 2011 passed out from IIIT Hyderabad, I would like to contribute for AmbitionBox by sharing my experience of Amazon Interview process. This was for a SDE position in Bangalore.I had one online test. After that 4 round of F2F interviews and I cracked it.
Skills: Algorithm, data structure
College Name: IIIT HYDERABAD

Skills evaluated in this interview

Interview Questionnaire 

12 Questions

  • Q1. Given a binary tree and an integer x, return whether the binary tree has a path from root to a leaf whose values sum to x
  • Q2. Gievn a binary tree and return all root to leaf node pathss row,col and value
  • Ans. 

    Return all root to leaf node paths of a binary tree with row, col and value.

    • Traverse the binary tree recursively and keep track of the current path.

    • When a leaf node is reached, add the path to the result.

    • Include row, col and value of each node in the path.

    • Use a data structure like a list or array to store the paths.

    • Consider edge cases like empty tree or single node tree.

  • Answered by AI
  • Q3. He then asked me to give test cases for testing this program
  • Q4. Given two unsorted arrays of numbers and asked me to find the intersection
  • Q5. GetMax() function for a stack in O(1)
  • Ans. 

    Use an auxiliary stack to keep track of the maximum element at each step.

    • Create an auxiliary stack to store the maximum element at each step.

    • When pushing an element onto the main stack, compare it with the top element of the auxiliary stack.

    • If the new element is greater, push it onto the auxiliary stack.

    • When popping an element from the main stack, also pop the top element from the auxiliary stack if they are equal.

    • To g...

  • Answered by AI
  • Q6. GetMax() function for a queue in O(1)
  • Ans. 

    Implement a getMax() function for a queue that returns the maximum element in O(1) time complexity.

    • Maintain a separate data structure (e.g., a max heap) to track the maximum element in the queue.

    • Whenever an element is enqueued, compare it with the current maximum and update if necessary.

    • When dequeuing, check if the dequeued element is the maximum and update the maximum if needed.

  • Answered by AI
  • Q7. Given an array in which consecutive elements differ by 1, i.e. a[i] – a[i + 1] = 1 or -1, and an element x, find the element in the array
  • Q8. Given an array, find the Next Greatest Element to the right for each element
  • Ans. 

    Find the Next Greatest Element to the right for each element in an array.

    • Iterate through the array from right to left

    • Use a stack to keep track of elements

    • Pop elements from stack until a greater element is found

    • If no greater element is found, assign -1

    • Reverse the result array

  • Answered by AI
  • Q9. Given an expression, remove unnecessary parenthesis. For example if (((a + b)) * c) is given make it (a + b) * c, as it evaluates in the same way without those parenthesis also
  • Ans. 

    Remove unnecessary parenthesis from an expression.

    • Identify the innermost expression enclosed in parenthesis.

    • Check if the parenthesis are necessary for evaluation.

    • If not, remove the parenthesis and repeat the process.

    • Stop when no more unnecessary parenthesis are found.

  • Answered by AI
  • Q10. Given an array of integers, find the maximum product which can be formed by three numbers
  • Ans. 

    Find the maximum product of three integers in an array.

    • Sort the array in descending order.

    • Check the product of the first three numbers and the product of the first and last two numbers.

    • Return the maximum product.

    • Handle negative numbers by checking the product of two smallest negative numbers and the largest positive number.

  • Answered by AI
  • Q11. Given an array of integers, find the length of the longest consecutive sub array which forms an AP
  • Ans. 

    The length of the longest consecutive subarray forming an arithmetic progression in an array of integers.

    • Iterate through the array and keep track of the longest consecutive subarray forming an AP.

    • Use a hashmap to store the difference between each element and the previous element.

    • If the difference is the same as the previous difference, increment the length of the current subarray.

    • If the difference is different, update ...

  • Answered by AI
  • Q12. Given a binary tree, connect all the nodes at the same level. Each node will have a next pointer; you have to make it point to the next node to its right in the same level. If there is no such node, make ...

Interview Preparation Tips

General Tips: NA
Skills: Algorithm, Data structure
College Name: na
Motivation: NA
Funny Moments: NA

Skills evaluated in this interview

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

Uplers Interview FAQs

How many rounds are there in Uplers Lead Developer interview?
Uplers interview process usually has 3 rounds. The most common rounds in the Uplers interview process are Technical and Resume Shortlist.
How to prepare for Uplers Lead Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Uplers. The most common topics and skills that interviewers at Uplers expect are Angular, CSS, HTML, Javascript and MySQL.
What are the top questions asked in Uplers Lead Developer interview?

Some of the top questions asked at the Uplers Lead Developer interview -

  1. What are design patterns in larave...read more
  2. What are Facades in larav...read more

Tell us how to improve this page.

Uplers Lead Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

TCS Interview Questions
3.7
 • 10.5k Interviews
Infosys Interview Questions
3.6
 • 7.6k Interviews
Wipro Interview Questions
3.7
 • 5.6k Interviews
Amazon Interview Questions
4.1
 • 5k Interviews
Tech Mahindra Interview Questions
3.5
 • 3.8k Interviews
HCLTech Interview Questions
3.5
 • 3.8k Interviews
LTIMindtree Interview Questions
3.8
 • 2.9k Interviews
Swiggy Interview Questions
3.8
 • 428 Interviews
Uber Interview Questions
4.2
 • 150 Interviews
View all
Project Coordinator
55 salaries
unlock blur

₹2.8 L/yr - ₹10 L/yr

Talent Acquisition Executive
50 salaries
unlock blur

₹2.7 L/yr - ₹4.8 L/yr

Html Developer
39 salaries
unlock blur

₹1.9 L/yr - ₹6.3 L/yr

SEO Analyst
38 salaries
unlock blur

₹3 L/yr - ₹8.6 L/yr

Talent Acquisition Specialist
22 salaries
unlock blur

₹2.7 L/yr - ₹6 L/yr

Explore more salaries
Compare Uplers with

Amazon

4.1
Compare

Udaan

4.0
Compare

Uber

4.2
Compare

Fareportal

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