Filter interviews by
I had to make a to-do list application using Kotlin/Swift/React Native
Observable in Swift is a property wrapper that allows for automatic notifications when the value changes.
Observable is a property wrapper introduced in Swift 5.1.
It can be used with any property that needs to be observed for changes.
When the value of the property changes, any views using that property will be automatically updated.
Example: @Published var score: Int = 0
Swift was chosen for its performance, native iOS support, and better integration with Apple's ecosystem.
Swift offers better performance compared to React Native due to its native code execution.
Swift provides seamless integration with Apple's ecosystem, allowing for better utilization of iOS features.
Swift is the preferred choice for developing iOS apps as it is the native language for iOS development.
React Native may ...
4 DSA questions, 10 Questions of SQL queries, MCQS of APIS, DBMS
I applied via Referral and was interviewed in Sep 2024. There were 2 interview rounds.
They given 4 question based on DSA topics such as graph, DP, Array . All questions level medium to hard .
I was interviewed in May 2024.
It involved 3-4 questions on dsa.
LCA of a binary tree is the lowest common ancestor of two nodes in the tree.
Traverse the tree from the root node to find the paths from root to the two given nodes.
Compare the paths to find the last common node, which is the LCA.
Use recursion to solve the problem efficiently.
Handle edge cases like if one of the nodes is the ancestor of the other.
Buyhatke interview questions for popular designations
2 hours of basic dsa
Foreign keys are columns in a database table that reference the primary key of another table, establishing a relationship between the two tables.
Foreign keys ensure referential integrity in a database by enforcing relationships between tables.
They help maintain data consistency by preventing actions that would violate the relationships between tables.
For example, in a database with tables for 'orders' and 'customers', ...
Depth first search in tree is implemented using recursion to explore each branch fully before moving to the next.
Start at the root node and recursively visit each child node before moving to the next sibling node.
Use a stack to keep track of nodes to visit, pushing children onto the stack before siblings.
Base case is when the current node is null or a leaf node, then backtrack to the parent node.
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
Start burning from the given node and spread fire to adjacent nodes each minute
Track the time taken for each node to burn completely
Return the maximum time taken to burn the entire tree
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
You want to visit your friend’s house located at some position in an infinite grid starting from origin (0, 0). You can move in four directions: East (E), West (W), North ...
Given a directional string representing a route to a friend's house in an infinite grid, find the shortest lexicographically smallest route to reach the destination.
Iterate through the directional string and keep track of the movements in each direction (E, W, N, S).
Calculate the final position based on the movements and find the shortest lexicographically smallest route to reach that position.
Consider the constraints ...
Tip 1 : Strengthen DSA skills initially, know the basics and understand the working of different data structures
Tip 2 : Learn to implement them and enhance your coding skills. Make mistakes and learn from them instead of just cramming everything before practicing.
Tip 3 : To enhance coding skills, try your best to crack a question instead of giving up and looking at the solution. This will improve your problem-solving skills.
Tip 1 : Make sure your resume fits everything into a single page.
Tip 2 : Have at least 2 projects on your resume.
Tip 3 : Only Mention only those technical skills that you are confident in. Do not put false things on your resume.
Tip 4 : Mention the work you have done during your internships.
Tip 5 : Include an objective in your resume.
Top trending discussions
based on 8 interviews
Interview experience
based on 12 reviews
Rating in categories
0-1 Yrs
Not Disclosed
6-8 Yrs
Not Disclosed
3-6 Yrs
Not Disclosed
Software Developer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Designer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Flipkart
Snapdeal
Myntra
Shopclues