Filter interviews by
I was interviewed in Jan 2021.
Round duration - 90 Minutes
Round difficulty - Easy
It was a telephonic round. The interview asked me these questions.
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer started asking me questions. He gave me 2 problems. He was giving hints in case of any issues.
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
Find the number with the maximum frequency in an array of integers.
Iterate through the array and keep track of the frequency of each number using a hashmap.
Find the number with the maximum frequency and return it.
If multiple elements have the same maximum frequency, return the one that appears first in the array.
Round duration - 60 Minutes
Round difficulty - Medium
This was a technical interview. He gave me these questions one by one.
1. Again, how polymorphism works. Draw vtable and vptr
2. Producer consumer problem with synchronization
3. Difference between mutex, semaphore, and condition_variable.
4. Design parking lot system
5. Zigzag traversal of binary tree
Design a parking lot system with features like ticketing, availability tracking, and payment options.
Create a database to store information about parking spots, availability, and pricing
Implement a ticketing system to assign and track parking spots for each vehicle
Include sensors or cameras to monitor spot availability in real-time
Offer payment options such as cash, credit card, or mobile payment apps
Determine the zigzag level order traversal of a given binary tree's nodes. Zigzag traversal alternates the direction at each level, starting from left to rig...
Zigzag level order traversal of a binary tree alternates direction at each level, starting from left to right, then right to left.
Use a queue to perform level order traversal of the binary tree.
Maintain a flag to alternate the direction of traversal at each level.
Store nodes at each level in separate arrays and reverse the array if traversal direction is right to left.
Round duration - 90 minutes
Round difficulty - Medium
1. He asked about the producer-consumer problem but I told him that the same question is asked in the previous round.
Then interviewer went asking lots of questions related to producer and consumer. Lots of discussions like what is a writer is not there and the only reader is there and you need to find out how many readers are currently reading from the buffer.
2. Discussions about C++11 features. How thread and async is different
3. Design your own shared_ptr(How you will handle ownership)
4. Check If the binary tree is symmetrical.
5. Find elements in a rotated sorted array and then optimize it.
You are provided with a binary tree structure, where each node consists of an integer value. Your task is to determine whether this binary tree is symmetric.
A symmetr...
Determine if a binary tree is symmetric by checking if its left and right subtrees are mirror images of each other.
Check if the left and right subtrees of the root node are mirror images of each other
Recursively check if the left subtree of the left child is a mirror image of the right subtree of the right child, and vice versa
Base case: If both nodes are null, return true; If one node is null and the other is not, ret...
Given a rotated sorted array ARR
of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
1. If 'K' is not present...
Given a rotated sorted array, find the index of a given integer 'K'.
Perform binary search to find the pivot point where the array is rotated.
Based on the pivot point, apply binary search on the appropriate half of the array to find 'K'.
Handle cases where 'K' is not present in the array by returning -1.
Tip 1 : Don't lie on your resume.
Tip 2 : Practice at least 400 different types of coding problems.
Tip 3 : Work on your communication skills.
Tip 1 : Don't put false things on your resume.
Tip 2 : Mention some good projects on your resume.
I was interviewed before May 2021.
Round duration - 123 minutes
Round difficulty - Medium
This was an online assessment round that consisted of 4 sections:
1) Cognitive Assessment (20 questions- 20 minutes): It had 2 sections.
English: (10 questions), which composed of comprehension-based and basic grammar questions,
Numerical Ability: (10 questions), which composed of questions on geometry, trigonometry, quadratic equations, probability, statistics, etc.
2) Technical Assessment (20 questions-20 minutes): It consisted of MCQs on Data Structures & Algorithms, DBMS, OOPs, OS, and Computer Networks.
3) Coding Assessment (2 questions- 60 minutes) The 2 questions were:
Similar to this -----/
Similar to this -----/
4) Gamified Assessment (3 tasks- 23 minutes): This section composed of mind game-based questions that had to be done according to the given instructions.
Given an integer K
, and two numbers A
and B
, count the occurrences of the digit K
in the range [A, B].
Include both the lower and upper limits in the count.
Count occurrences of a digit in a given range.
Iterate through the range [A, B] and count occurrences of digit K.
Convert integers to strings for easier digit comparison.
Handle edge cases like when A or B is equal to K.
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
The wildcard pattern may include the...
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
Create a recursive function to match the pattern with the text character by character.
Handle cases for '?' and '*' characters separately.
Use dynamic programming to optimize the solution.
Check for edge cases like empty pattern or text.
Round duration - 60 minutes
Round difficulty - Medium
The interview was scheduled for 9 Jan 21 from 6:00 pm. The interviewer started with “Tell me about yourself”. Then he asked some CS fundamental questions. I was asked about the singleton class and then about the memory layout in C++, then he moved on to the next question. He pasted a code snippet in the chatbox and asked me to tell the output. I copied the code to my local editor and explained my approach to finding the output. The code was related to the concept of virtual function and destructor in C++. After that, he asked me how much memory will be used by a struct that is storing 2 char variables and 1 int variable.
After that, he started with questions on data structures and algorithms and I was asked three questions.
Given a binary tree of integers, your task is to represent the binary tree in a 2-D array of strings with specific formatting rules.
The task is to represent a binary tree in a 2-D array of strings with specific formatting rules.
Create a 2-D array of strings with 'H' rows and odd number of columns.
Fill in the array based on the given binary tree, following the specified formatting rules.
Leave empty strings for unfilled cells and adjust spacing for empty subtrees.
Ensure the output matches the example provided in the question.
Given ‘N’ items, each with a specific profit and weight, and a knapsack with a weight capacity ‘W’. The objective is to fill the knapsack such that the total profit is...
The Unbounded Knapsack Problem involves maximizing profit by filling a knapsack with items of specific profit and weight.
Iterate through each item and calculate the maximum profit that can be obtained by including or excluding the item in the knapsack.
Use dynamic programming to store and reuse subproblem solutions to optimize the solution.
The final answer will be the maximum profit that can be obtained by filling the k
Given a string containing only '{' and '}', determine the minimum cost required to make the string valid. A string is considered valid if for every opening bracket '{', t...
Given a string with only '{' and '}', find the minimum cost to make it valid by converting brackets.
Iterate through the string and keep track of the opening and closing brackets
If there are more closing brackets than opening brackets, convert the excess closing brackets to opening brackets
If there are more opening brackets than closing brackets, convert the excess opening brackets to closing brackets
Return the total co...
Tip 1 : For DSA questions in interviews, start explaining from the brute force approach and then move to the optimal one. Convey your thought process to the interviewers, so that they can help you out if you get stuck. Communication skills matter a lot, and I think that is what makes the difference!
Tip 2 : Do some research about the company you are interviewing for and prepare the answers to the questions like Why should we hire you? (frame your answer in such a way that shows that your career goals align with the goals of the company), Why XYZ company?, Competitors of XYZ, etc. beforehand. Read about some latest news related to the company so that you can ask questions based upon that when the interviewer allows you to ask any question. This shows that you are genuinely interested to work for the company.
Tip 3 : Spend proper time making your resume and get it reviewed by seniors. Do not write anything that you are not confident of. Even if you write something that you don’t know, just be prepared that how you will defend it. The interviewers are much much experienced than you and they’ll catch you easily if you lie. So don’t take risk here.
Tip 1 : Try to include at least one development project in your resume.
Tip 2 : Do not write anything on the resume that you are not confident of. Even if you write something that you don’t know, just be prepared that how you will defend it. The interviewers are much much experienced than you and they’ll catch you easily if you lie.
I was interviewed in Dec 2020.
Round duration - 70 minutes
Round difficulty - Easy
Timing : 11:00 am
Webcam was mandatory.
You are provided with an array called ARR
, consisting of distinct positive integers. Your task is to identify all the numbers that fall within the range of the smallest a...
Identify missing numbers within the range of smallest and largest elements in an array.
Find the smallest and largest elements in the array.
Generate a list of numbers within this range.
Remove numbers that are present in the array.
Sort and return the missing numbers.
You are provided with an array ARR
consisting of 'N' positive integers. Your task is to determine if each number in the array ARR
has exactly 3 factors.
You need to...
Determine if each number in the array has exactly 3 factors.
Iterate through each number in the array and check if it has exactly 3 factors.
Factors of a number can be found by iterating from 1 to the square root of the number.
Count the number of factors and return 1 if it is exactly 3, else return 0.
Round duration - 108 minutes
Round difficulty - Medium
Timing : 10:00 am
Webcam was mandatory
Given a N * N
maze with a rat placed at position MAZE[0][0]
, find and print all possible paths for the rat to reach its destination at MAZE[N-1][N-1]
. The rat is allowed to...
Find all possible paths for a rat in a maze to reach its destination.
Implement a backtracking algorithm to explore all possible paths in the maze.
Keep track of the current path and mark visited cells to avoid loops.
Return the paths that lead from the start position to the destination.
Example: [[1, 0, 0], [1, 1, 0], [0, 1, 1]]
In Ninja town, represented as an N * M
grid, people travel by jumping over buildings in the grid's cells. Santa is starting at cell (0, 0) and must deliver gifts to cell (N-1, ...
Santa needs to find the quickest path to deliver gifts in Ninja town by jumping over buildings with least travel time.
Santa can jump to (x+1, y+1), (x+1, y), or (x, y+1) from any cell (x, y) within grid boundaries.
The travel time between two buildings equals the absolute difference in their heights.
Find the shortest path from (0, 0) to (N-1, M-1) using dynamic programming or Dijkstra's algorithm.
Consider all possible p...
Round duration - 70 minutes
Round difficulty - Medium
Timing : 5 pm
Camera and mic was mandatory.
The interviewer was really nice and adjustable.
You are provided with a string S
. Your task is to determine and return the number of distinct substrings, including the empty substring, of this given string. Implement the solut...
Count distinct substrings of a given string using trie data structure.
Implement a trie data structure to store all substrings of the given string.
Count the number of nodes in the trie to get the distinct substrings count.
Handle empty string case separately.
Example: For 'ab', distinct substrings are: '', 'a', 'b', 'ab'.
Determine the zigzag level order traversal of a given binary tree's nodes. Zigzag traversal alternates the direction at each level, starting from left to rig...
Zigzag level order traversal of a binary tree alternating direction at each level.
Use a queue to perform level order traversal of the binary tree.
Maintain a flag to alternate the direction of traversal at each level.
Store nodes at each level in separate lists and reverse the list if traversal direction is right to left.
Tip 1 : You should have in depth knowledge of your projects. Sometimes Adobe spend a whole interview in project discussion (in some cases).
Tip 2 : OOPS is a very important subject if you are preparing for Adobe. Also one should know real life examples of it and should be able to code any concept of it.
Tip 3 : One should have good knowledge of data structures. Mainly Array, Math, Tree, Recursion and LinkedList.
Tip 4 : According to me , projects just play role if you applying off campus and that too for the shortlisting of your resume as it gives you an edge in respect to other candidates. So if you are applying off campus you should have atleast 2-3 good projects in you resume.
Tip 1 : One should have good projects.
Tip 2 : The presentation of your resume should be really good. Bold keywords like tech stack you used or the topics you are really good at.
I was interviewed in Jan 2021.
Round duration - 40 minutes
Round difficulty - Medium
It was in the evening. This round consists of 20 MCQs which covers portions from Data Structures, Aptitude, Coding based, etc. There is no negative marking for wrong answers
You are given an array or list consisting of 0s and 1s only. Your task is to find the sum of the number of subarrays that contain only 1s and the number of subarrays that contain o...
Count the number of subarrays containing only 1s and 0s in a given array of 0s and 1s.
Iterate through the array and count consecutive 1s and 0s separately.
Use two variables to keep track of the count of 1s and 0s subarrays.
Add the counts of 1s and 0s subarrays to get the final result.
Round duration - 30 Minutes
Round difficulty - Medium
It was in the morning. There is video call with the faculty of the company which interviews. Questions comes from my projects, skills, college studies
Tip 1 : Practice coding questions as much as possible
Tip 2 : Do relevant projects
Tip 3 : Focus more on practical work
Tip 1 : Skills should be mentioned in a proper way
Tip 2 : Resume should be in proper format without any error and only true skills should be mentioned
Adobe interview questions for designations
I was interviewed before Nov 2020.
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...
Kevin has two packs of cards. The first pack contains N cards, and the second contains M cards. Each card has an integer written on it. Determine two results: the tot...
Given a board with 2 rows and N columns, and an infinite supply of 2x1 tiles, determine the number of distinct ways to completely cover the board using these tiles.
You can place...
You are given an array/list CHOCOLATES
of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...
The test was in the morning of 2 hours. 9-11. (45 mins relaxation)
It was a protocured examination.
The test was difficult. It was in the morning at 9 AM. Again it was a protocured examination. We had 20 cognitive 20 technical 2 coding difficult and gamified assesments.
Adobe interview preparation:Topics to prepare for the interview - Data Structures, Arrays, OOPS, Graphs, TreesTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekersTip 1 : Practice all questions from easy to difficult level.
Tip 2 : At least practice 200 questions.
Tip 3 : Practice theory and aptitude questions as well.
Tip 1 : Provide all the necessary details of your skills.
Tip 2 : Remember to give your correct information.
Get interview-ready with Top Adobe Interview Questions
I was interviewed before Sep 2020.
Round duration - 50 minutes
Round difficulty - Hard
My Interview for Adobe was on 16 September, 2019 . And my interview was telephonic interview and timing was about 12:00PM. And I got a call at about 12:15 PM .
You are presented with a binary tree where each node holds an integer, along with a specified number 'K'. The task is to identify and print every path that ex...
The task is to identify and print every path in a binary tree whose node values sum up to a specified number 'K'.
Traverse the binary tree to find paths with sum equal to 'K'.
Print each valid path in the order encountered in the tree.
Handle cases where nodes may have missing children (-1).
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure to sort elements in ascending or descending order.
Heap sort works by first building a max heap from the input array, then repeatedly removing the largest element from the heap and placing it at the end of the array.
The complexity of heap sort is O(n log n) for both time and space, making it efficient for large datasets.
Example: Giv...
Tip 1 : Prepare OOPS very well, because they ask a lot of questions from OOPS.
Tip 2 : Practice Coding problems as much as you can because they will ask you to write codes.
Tip 3 : Prepare Your course subjects such as Operating system, Java, DBMS.
Tip 1 : Keep Your resume at most of one page
Tip 2 : Mention only those things at which you have great knowledge. Don't write anything just to make your resume attractive.
Top trending discussions
I was interviewed before Dec 2020.
Round duration - 60 minutes
Round difficulty - Easy
This was a 60 minute technical round involving questions based on data structures, OOPS concepts, DBMS and projects that I had mentioned in my resume.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using recursion or dynamic programming.
Implement a recursive function to calculate the Nth Fibonacci number.
Use memoization to store previously calculated Fibonacci numbers for efficiency.
Consider using dynamic programming to optimize the solution.
Handle edge cases such as N = 1 or N = 2 separately.
Ensure the solution works efficiently for large values of N (up to 10000).
Operator overloading in OOP allows custom behavior for operators like +, -, *, etc.
Operator overloading is a feature in OOP that allows defining custom behavior for operators
Example: Overloading the + operator to concatenate strings or add two numbers
Example: Overloading the * operator to perform matrix multiplication
Function overloading is when multiple functions have the same name but different parameters or return types.
Allows multiple functions with the same name but different parameters or return types
Helps improve code readability and maintainability
Example: int add(int a, int b) and float add(float a, float b)
C is a procedural programming language while C++ is a multi-paradigm programming language with object-oriented features.
C is a procedural programming language while C++ supports both procedural and object-oriented programming.
C does not support classes and objects while C++ does.
C does not have built-in support for exception handling while C++ does.
C does not have namespaces while C++ does.
C does not have function over
Round duration - 45 minutes
Round difficulty - Easy
HR round that lasted for 45 minutes. Did brainstorming on puzzles and HR asked questions to know more about me.
Tips : During HR, think before you speak, they can catch any word that you speak. Prepare well for aptitude, as they shortlist less people after the test. Ask good questions during the end of the interviews. It might impress them. So prepare for it before going for the interview. Lastly, don’t be nervous, HRs are only trying to make you nervous during the interview as a part of the stress test.
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 was interviewed before Dec 2020.
Round duration - 60 minutes
Round difficulty - Medium
This was a 60 minute technical round where the interviewer asked programming based questions and questions on DBMS concepts.
Given an array of 'N' non-negative integers and an integer 'K', your task is to find the maximum elements for each subarray of size 'K'.
The first line contains...
Find the maximum elements for each subarray of size 'K' in an array of non-negative integers.
Iterate through the array and maintain a deque to store the indices of elements in decreasing order.
Pop elements from the deque if they are out of the current window of size 'K'.
The front of the deque will always have the index of the maximum element in the current window.
ACID properties are a set of properties that guarantee the reliability of transactions in database management systems.
Atomicity ensures that either all operations in a transaction are completed successfully or none of them are. For example, transferring money from one account to another should either be completed in full or not at all.
Consistency ensures that the database remains in a consistent state before and after ...
Write-ahead logging is a technique used in DBMS to ensure that changes are recorded in the log before they are applied to the database.
Write-ahead logging ensures that changes are first written to the log file before being applied to the database to maintain data integrity.
It helps in recovering the database in case of a system crash or failure by replaying the log entries to bring the database back to a consistent sta...
Deadlock avoidance schemes are strategies used to prevent deadlocks in a system.
Banker's algorithm: Ensures that the system will never enter an unsafe state by keeping track of available resources and only granting a request if it does not lead to a deadlock.
Wait-die and Wound-wait: Two deadlock prevention schemes used in transaction processing systems to avoid deadlocks by allowing transactions to wait or abort based ...
A clustered index is a type of index that sorts and stores the data rows in the table based on their key values.
Defines the order in which data is physically stored in a table
Only one clustered index per table
Helps in improving the performance of queries that involve range searches or sorting
Example: Clustered index on a table's primary key
Round duration - 60 minutes
Round difficulty - Easy
This was a 60 minute technical round where the interviewer asked data structure based questions, questions on OOPS and OS concepts.
A virtual function in C++ is a function that is declared within a base class and is redefined by a derived class.
Virtual functions allow a function to be overridden in a derived class.
They are used in polymorphism to achieve runtime binding.
The base class function must be declared as virtual for dynamic binding to occur.
Example: virtual void display() = 0; // pure virtual function
malloc() is used to dynamically allocate memory in C, while free() is used to release allocated memory.
malloc() allocates a block of memory of specified size and returns a pointer to the beginning of the block.
free() deallocates the memory previously allocated by malloc() or calloc().
Example: int *ptr = (int*)malloc(5 * sizeof(int)); // Allocates memory for 5 integers
Example: free(ptr); // Deallocates the memory alloca
Structure padding is the concept of adding empty bytes to a structure to align its data members on memory boundaries.
Structure padding is done to optimize memory access and improve performance.
Padding is necessary because most processors require data to be aligned on specific memory boundaries for efficient access.
For example, if a structure contains a char followed by an int, padding may be added after the char to ali
Round duration - 30 minutes
Round difficulty - Easy
HR based round that lasted for 30 minutes. The interviewer asked question to know more about me.
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 was interviewed before Dec 2020.
Round duration - 90 minutes
Round difficulty - Easy
Online test had 6 parts-psychometric test, aptitude, logical, English, computer skills and 2 coding questions. Time given to us was 90 minutes. Paper was quite lengthy and of average difficulty level. I was able to complete all the sections, but only one coding question.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints provided in the problem statement.
T...
Round duration - 60 minutes
Round difficulty - Medium
Firstly the interviewer asked me to introduce myself after he introduced himself. Since i went there as experienced guy he asked me about my workings in the current company. After that,he asked some programming questions, tested my concepts of DBMS and OOPS, and some puzzles.
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Explore neighbor nodes first before moving to the next level neighbors.
Consider the bidirectional nature of edges in an undirected graph.
Output the BFS traversal sequence for each test case in a separate line.
Given a positive integer N
, your task is to identify all prime numbers less than or equal to N
.
A prime number is a natural number greater than 1 that has no po...
Identify all prime numbers less than or equal to a given positive integer N.
Iterate from 2 to N and check if each number is prime
Use the Sieve of Eratosthenes algorithm for efficient prime number identification
Optimize by only checking up to the square root of N for divisors
BCNF is a normal form in database management systems that ensures all determinants are candidate keys.
BCNF stands for Boyce-Codd Normal Form.
It is a stricter version of 3NF (Third Normal Form).
In BCNF, every determinant must be a candidate key.
It helps in reducing redundancy and anomalies in the database.
Example: If a table has columns A, B, and C, and A determines B and B determines C, then it is not in BCNF unless A
C is a procedural programming language while C++ is an object-oriented programming language with features like classes and inheritance.
C is a procedural programming language, while C++ is a multi-paradigm language with support for object-oriented programming.
C does not support classes and objects, while C++ does.
C uses structures for data organization, while C++ uses classes.
C does not have features like inheritance an...
Round duration - 60 minutes
Round difficulty - Easy
Again 2nd round started with an introduction from both sides. Then he started asking questions from resume itself. Working in the current company and all the projects that i have done. Few simple puzzles, OOPs concepts (with proper explanation and coding) and some database related questions(questions were easy you just need to brush up the basics). Some keywords related questions from C,C++,Java(usual questions like static ,final, abstract etc.). That was the 2nd round. Then I was called for the 3rd Round. Before 3rd round they also served tasty lunch.
Given a binary tree of integers, your task is to output the right view of the tree.
The right view of a binary tree includes the nodes that are visible when the tree is observed...
The task is to output the right view of a binary tree, which includes the nodes visible when observed from the right.
Traverse the tree level by level and keep track of the rightmost node at each level.
Use a queue for level order traversal and a map to store the rightmost nodes.
Print the values of the rightmost nodes stored in the map as the right view of the tree.
Round duration - 45 minutes
Round difficulty - Easy
After that he asked me what I knew about SAP and there products(Please do read all about SAP and there products-not all but at least some famous products like ERP). Then he asked me one puzzle.
Round duration - 45 minutes
Round difficulty - Easy
The round started with our Introduction to each other. After that interviewer asked me whether I do online shopping or not. I said yes then he asked me to design the online shopping portal using ER-Diagram . Then he asked me to create all the tables and populate it with data. Later on he asked me to normalize it. After all of this he asked me some simple puzzles and current salary and notice period. That was the 4th round.
After that I was asked to attend the final round and before 5th round they served snacks and tea to all of us.
Yes, I can design an ER diagram for an online shopping portal.
Entities: User, Product, Order, Payment, Cart
Relationships: User places Order, Order contains Product, Payment for Order, User has Cart
Attributes: User (id, name, email), Product (id, name, price), Order (id, date), Payment (id, amount)
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 was interviewed before Dec 2020.
Round duration - 60 minutes
Round difficulty - Easy
The test had a time limit. Every 10 minutes you had to do at least 4 questions. It was quite fast paced. The questions were from basic coding, aptitude and debugging.
Tips: Learn to be fast at coding. Practice a lot of aptitude questions. Have a decent knowledge of basic coding.
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of current, previous, and next nodes
Update the next pointer of each node to point to the previous node
Given a string S
of length L
, determine the length of the longest substring that contains no repeating characters.
"abac...
Find the length of the longest substring without repeating characters in a given string.
Use a sliding window approach to keep track of the longest substring without repeating characters.
Use a hashmap to store the index of each character as it appears in the string.
Update the start index of the window when a repeating character is found.
Calculate the maximum length of the substring as the window slides through the strin
Round duration - 60 minutes
Round difficulty - Easy
The interviewer started off by asking basic sorting questions. Followed by data structures and algorithms. And DBMS related questions in the end.
Tips: Have a good presence of mind. Understand the question asked properly. Be confident and keep discussing. Don't get nervous and solve the questions incorrectly. Have good grip over topics like sorting, DS, Algorithms and DBMS.
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...
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other.
Consider edge cases like when X or Y is the root node.
Implement a recursive or iterative solution to find the LCA efficiently.
You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...
The task is to rearrange a given permutation of 'N' integers to form the lexicographically next greater permutation.
Iterate from right to left to find the first element that is smaller than the element to its right.
Swap this element with the smallest element to its right that is greater than it.
Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.
Round duration - 30 minutes
Round difficulty - Easy
The round was based around my over all personality. They checked how would I be an asset to their company. They analyzed my core values and capabilities of working in a team.
Tips: Show that you are willing to work in a team. Be confident and polite. Express your feelings and passion towards your job and the company. Explain your college extra curricular activities well.
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.
based on 2 reviews
Rating in categories
Computer Scientist
441
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Consultant
278
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
254
salaries
| ₹0 L/yr - ₹0 L/yr |
Computer Scientist 2
231
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Technical Consultant
204
salaries
| ₹0 L/yr - ₹0 L/yr |
Salesforce
Oracle
Microsoft Corporation
Amazon