i
Toast
Work with us
Filter interviews by
I appeared for an interview in Apr 2025, where I was asked the following questions.
Check if there exists one number from each of two sorted lists that sums up to a given target value.
Two-Pointer Technique: Use two pointers, one starting at the beginning of the first list and the other at the end of the second list.
Iterate and Compare: If the sum of the values at the two pointers equals the target, return true. If the sum is less, move the first pointer right; if more, move the second pointer left.
Exa...
A priority queue is a data structure where each element has a priority, and elements are dequeued based on priority.
Elements are added with a priority level; higher priority elements are dequeued first.
Common implementations include binary heaps, Fibonacci heaps, and unsorted arrays.
Example: In a hospital, patients are prioritized based on the severity of their condition.
Operations: Enqueue adds an element with a prior...
Top trending discussions
I applied via Naukri.com and was interviewed in Sep 2022. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before Apr 2023. There was 1 interview round.
In genenal, apptitude, Puzzles, CS fundamentals
I applied via Campus Placement and was interviewed before May 2023. There were 3 interview rounds.
The interview involved coding questions based on java (easy).
I would implement a machine learning algorithm to optimize the system's performance and efficiency.
Implementing a recommendation system to suggest personalized content to users based on their preferences and behavior.
Integrating natural language processing to improve the system's ability to understand and respond to user queries.
Utilizing predictive analytics to forecast future trends and make data-driven decisions for...
I applied via Naukri.com and was interviewed before Dec 2023. There was 1 interview round.
Basic java question were asked on inheritance etc
I applied via LinkedIn and was interviewed before May 2022. There were 3 interview rounds.
5 out of 3 questions has to be cleared
Declaration is a statement that tells the compiler about the existence of a variable or function, while definition provides the actual implementation of the variable or function.
Declaration introduces a name and its type to the compiler, while definition allocates memory for the variable or function.
Declaration does not allocate memory, while definition does.
Multiple declarations can exist for a single definition, but ...
I applied via Company Website and was interviewed in Aug 2021. There were 4 interview rounds.
C is a procedural programming language with low-level memory access and a rich set of operators.
C is a compiled language
C has a simple syntax and a small set of keywords
C supports pointers and manual memory management
C has a rich set of operators and control structures
C is widely used for system programming, embedded systems, and game development
I applied via Campus Placement and was interviewed in May 2022. There were 4 interview rounds.
4 coding questions, 1 SQL coding question
Primary key uniquely identifies a record, foreign key refers to a field in another table.
Primary key is used to ensure uniqueness of a record in a table
Foreign key is used to establish a relationship between two tables
Primary key cannot be null, foreign key can be null
Primary key is used as a reference in foreign key
I have a strong interest in the banking industry.
I have studied finance and economics in college.
I have completed internships at banks and financial institutions.
I enjoy following the stock market and analyzing financial data.
I am excited about the potential for technology to revolutionize banking.
I believe that the banking industry plays a crucial role in the global economy.
Algorithm and flow chart for bubble sort on an array
Compare adjacent elements and swap if necessary
Repeat until no more swaps are needed
Time complexity: O(n^2)
Space complexity: O(1)
A flow chart for sorting
Start with an unsorted list
Compare adjacent elements and swap if necessary
Repeat until no more swaps are needed
List is now sorted
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
Timing: 90 mins
Environment: Online coding round
No of questions: 3 Questions(225 marks) were asked.
You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm.
Quick sort is a divide-and-conquer algorithm. It ...
Yes, the quick sort algorithm can be enhanced to achieve NlogN complexity in the worst case by using randomized quick sort or median of three pivot selection.
Use randomized quick sort to randomly select the pivot element, reducing the chances of worst-case scenarios.
Implement median of three pivot selection to choose a pivot that is closer to the median value, improving partitioning efficiency.
Consider using dual pivot...
You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is to find the K'th character of the d...
Given an encrypted string with repeated substrings represented by counts, find the K'th character of the decrypted string.
Parse the encrypted string to extract substrings and their counts
Iterate through the substrings and counts to build the decrypted string
Track the position in the decrypted string to find the K'th character
You have 'N' jobs, each with a start time, end time, and profit. Your task is to identify the maximum profit that can be earned by scheduling these jobs such that...
The Weighted Job Scheduling problem involves maximizing profit by scheduling non-overlapping jobs with given start times, end times, and profits.
Sort the jobs by end time in ascending order.
Initialize an array 'dp' to store maximum profit at each job index.
For each job, find the latest non-overlapping job and update 'dp' with the maximum profit.
Return the maximum profit from 'dp'.
Round duration - 45 minutes
Round difficulty - Medium
Timing: evening
Environment: Virtual(remote)
Activity:
It was a resume screening + DSA round . There were 2 interviewers in this round. Initially , a brief introduction was given by them & later , they started with projects listed in my resume . They first asked me to explain about the projects , asked some questions related to its implementation & its actual use case in real world (where it can be used) .Later , they switched to DSA part , a total of 2 questions of easy medium difficulty level were asked . I only remember 1 question that was similar to Minimum platform problem.
After this , They asked me for favourite subjects. I said Operation Systems . Then , they asked for some concepts in OS , including CPU scheduling & its algos like Round robin , SJF etc and later asked which type of scheduling algorithm is used to design actual systems .
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Given two arrays:
AT
- represent...Determine the minimum number of platforms needed at a railway station so that no train has to wait.
Sort the arrival and departure times arrays in ascending order.
Use two pointers to iterate through the arrays and keep track of the number of platforms needed.
Increment the number of platforms needed when a train arrives and decrement it when a train departs.
Return the maximum number of platforms needed at any point.
Examp...
Round duration - 50 minutes
Round difficulty - Medium
It was System design round.Though , it also started with a brief introduction & later , asked about projects . As my project was related to test classification . In that context , they asked me to design a low level Suggestion system(In any preferred language) .
You are provided with a list of strings, DICTIONARY[]
, representing the correct spellings of words, and a query string QUERY
that may contain misspelled words. Your task is...
Given a list of correct spellings and a query string, return a list of suggested correct spellings if the query is misspelled.
Iterate through the dictionary to check for matching prefixes with the query string.
If a match is found, add the corresponding word to the list of suggestions.
Return the list of suggestions if the query is misspelled, otherwise return an empty list.
Tip 1 : Practice a lot of problems from leetcode/coding ninjas or some other platform.
Tip 2 : Participate in daily contests on codeforces, leetcode, kickstart, etc.
Tip 3 : Include new topics while learning/solving Data structures problems like tries, BIT, etc.
Tip 1 : Mention your competitve programming skills and profiles in resume if possible.
Tip 2 : While mentioning things in resume: mention by numbers.
Tip 3 : Make a neet resume in some standard format(maybe by using LaTeX)
Tip 4 : Have atleast 2 projects(on which you are confident) in resume
Tip 5 : Don't put false positive on resume.
Some of the top questions asked at the Toast Software Engineer Intern interview -
based on 1 interview experience
Difficulty level
Duration
Technical Consultant
18
salaries
| ₹20 L/yr - ₹26 L/yr |
Software Engineer
15
salaries
| ₹5.9 L/yr - ₹25 L/yr |
Software Engineer2
15
salaries
| ₹8.5 L/yr - ₹34 L/yr |
Assistant Manager
14
salaries
| ₹11.5 L/yr - ₹11.5 L/yr |
Senior Software Engineer
10
salaries
| ₹20.4 L/yr - ₹45 L/yr |
Thomson Reuters
Oracle Cerner
NextComm Corporation
Temenos