i
Toast
Filter interviews by
I applied via LinkedIn and was interviewed in Nov 2024. There was 1 interview round.
It was easy basic questions were there and we were asked to write two emails.
I applied via Company Website and was interviewed in Feb 2024. There were 2 interview rounds.
Normal Basic Interview GK, Maths,Average.
Using 'continue' in a loop to skip current iteration and move to the next one.
Continue statement is used to skip the current iteration of a loop and move to the next one.
Helps in avoiding unnecessary code execution within a loop.
Example: for(int i=0; i<5; i++) { if(i == 2) { continue; } System.out.println(i); }
I applied via Company Website and was interviewed in Mar 2024. There was 1 interview round.
There were 50 question out of which if you score 20 you were passed out to next round, No negative markings.
posted on 30 Oct 2023
C# is a programming language developed by Microsoft for building a wide range of applications on the .NET framework.
C# is an object-oriented language with features like classes, inheritance, and polymorphism.
It is strongly typed, meaning variables must be declared with a specific data type.
C# supports modern programming concepts like async/await for asynchronous programming.
It is commonly used for developing desktop, w...
I applied via Naukri.com and was interviewed before Jan 2024. There was 1 interview round.
I was interviewed before Feb 2022.
I was interviewed before Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
The second round is also written but you need to write programming based on their concept.
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...
The naïve approach for this question is to run a loop from the start to the end number. And for each number, check if it is prime or not. If the number is prime, we print it otherwise skip it.
One optimization to this approach would be to skip all even numbers (except 2 if present in interval) since even numbers are not prime.
Function to check if a number is prime or not :
isPrime(n):
if (n <= 1) return false
for (i=2;
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
The string 'S' should be evaluated in a case...
The idea is to create a copy of num and recursively pass the copy by reference, and pass num by value. In the recursive calls, divide num by 10 while moving down the recursion tree. While moving up the recursion tree, divide the copy by 10. When they meet in a function for which all child calls are over, the last digit of num will be ith digit from the beginning and the last digit of copy will be ith digit from the end
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions mainly on Java and OOPS concepts.
Instance method can access the instance methods and instance variables directly.
Instance method can access static variables and static methods directly.
Static methods can access the static variables and static methods directly.
Static methods can’t access instance methods and instance variables directly. They must use reference to object. And static method can’t use this keyword as there is no instance for ‘this’ to ref
1) Abstract class can have abstract and non-abstract methods. Interface can have only abstract methods. Since Java 8, it can have default and static methods also.
2) Abstract class doesn't support multiple inheritance. Interface supports multiple inheritance.
3) Abstract class can have final, non-final, static and non-static variables. Interface has only static and final variables.
4) Abstract class can provide the implem...
1. As the name suggests, ClassNotFoundException is an exception while NoClassDefFoundError is an error.
2. ClassNotFoundException occurs when classpath does not get updated with required JAR files while error occurs when the required class definition is not present at runtime.
1 Type :
Error : Classified as an unchecked type
Exception : Classified as checked and unchecked
2 Package :
Error : It belongs to java.lang.error
Exception : It belongs to java.lang.Exception
3 Recoverable/ Irrecoverable :
Error : It is irrecoverable
Exception : It is recoverable
4 Error : It can't be occur at compile time
Exception : It can occur at run time compile time both
5 Ex...
The serialization at runtime associates with each serializable class a version number called a serialVersionUID, which is used during deserialization to verify that the sender and receiver of a serialized object have loaded classes for that object that are compatible with respect to serialization.
Following are the requirements:
The class must be declared as final so that child classes can’t be created.
Data members in the class must be declared private so that direct access is not allowed.
Data members in the class must be declared as final so that we can’t change the value of it after object creation.
A parameterized constructor should initialize all the fields performing a deep copy so that data members can...
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.
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
based on 1 interview
Interview experience
Software Engineer
13
salaries
| ₹5.5 L/yr - ₹21.4 L/yr |
Software Engineer2
13
salaries
| ₹8.5 L/yr - ₹25 L/yr |
Senior Software Engineer
8
salaries
| ₹23 L/yr - ₹45 L/yr |
QA Engineer
7
salaries
| ₹5 L/yr - ₹12.4 L/yr |
Senior Automation Engineer
4
salaries
| ₹29 L/yr - ₹29.5 L/yr |
Swiggy
Zomato
Cafe Coffee Day
Barbeque Nation