Faster and better experience!
i
OneBanc Technologies
Filter interviews by
Clear (1)
I applied via Referral and was interviewed in Oct 2024. There was 1 interview round.
They asked about the OOPS questions and Coding questions basically based on general iOS Knowledge and Logical Questions, ending with one DSA question.
Top trending discussions
I applied via LinkedIn and was interviewed in Feb 2024. There were 3 interview rounds.
Delegate pattern is a design pattern in which an object delegates some of its responsibilities to another object.
Create a protocol defining the methods that the delegate should implement
Declare a delegate property in the delegating class
Set the delegate property to the object that will act as the delegate
Call the delegate methods from the delegating class
There are designated initializers in Swift that have specific behaviors, such as convenience init and required init.
Designated initializers are primary initializers for a class and must call a designated initializer from its superclass.
Convenience initializers are secondary initializers that must call another initializer in the same class.
Required initializers must be implemented by all subclasses of a class.
The bridge between SwiftUI and UIKit is represented by the UIViewRepresentable and UIViewControllerRepresentable protocols.
UIViewRepresentable and UIViewControllerRepresentable protocols allow SwiftUI views to interact with UIKit views and controllers respectively.
UIViewRepresentable is used to wrap a UIKit view and make it available to SwiftUI.
UIViewControllerRepresentable is used to wrap a UIKit view controller and m...
Flickr photo app with custom animation
I applied via LinkedIn and was interviewed in Apr 2024. There were 5 interview rounds.
Dsa hard level problems
To create a particular mobile screen, you need to design the layout using Interface Builder or programmatically in Swift.
Design the UI layout using Interface Builder in Xcode
Add necessary UI elements like labels, buttons, text fields, etc.
Customize the appearance using constraints, auto layout, and size classes
Implement functionality using Swift code to handle user interactions and data processing
I applied via Naukri.com and was interviewed in Apr 2020. There was 1 interview round.
Dagger is required for dependency injection in Android development.
Dagger helps in managing dependencies and reduces boilerplate code.
It provides compile-time safety and improves code readability.
Dagger also helps in testing and modularizing the codebase.
It is widely used in Android development for building scalable and maintainable apps.
The garbage collector in Android automatically manages memory by reclaiming unused objects.
Garbage collector identifies objects that are no longer referenced by the program.
It frees up memory occupied by these objects, making it available for future use.
The process involves marking objects as reachable or unreachable, and then reclaiming memory from unreachable objects.
Garbage collection can be triggered automatically ...
To set equal spacing between childs of constraint layout, use the chain style property.
Create a chain of the views that need equal spacing using the chain style property.
Set the chain style to spread inside the constraint layout.
Adjust the margins of the views to control the spacing.
Use the layout_constraintHorizontal_chainStyle or layout_constraintVertical_chainStyle attribute to set the chain style.
Example: app:layou
I applied via Referral and was interviewed in Sep 2024. There was 1 interview round.
Build a clone of Google Photos app
I applied via LinkedIn and was interviewed in Aug 2024. There was 1 interview round.
Leet code problem hard and some times medium questions
I applied via Approached by Company and was interviewed before Jun 2023. There were 2 interview rounds.
Android Assignment - Create an android project for a given scenario.
I applied via Approached by Company and was interviewed in Jun 2024. There was 1 interview round.
Develop a Movie SDK that will utilize a provided API to retrieve movie details.
I was interviewed in Aug 2021.
Round duration - 45 Minutes
Round difficulty - Easy
You are tasked with creating a class named BSTIterator
that acts as an iterator for the inorder traversal of a binary search tree. Implement the following functions:
BST...
Create a BSTIterator class for inorder traversal of a binary search tree.
Implement a constructor that takes the root of the binary search tree and initializes the iterator.
Implement next() function to return the next smallest element in the inorder traversal.
Implement hasNext() function to check if there is a next element in the inorder traversal.
Traverse the binary search tree in inorder to get the desired output.
Given an integer N
, convert it to its corresponding Roman numeral representation. Roman numerals comprise seven symbols: I, V, X, L, C, D, and M.
N = 2
Convert an integer to its corresponding Roman numeral representation.
Create a mapping of integer values to Roman numeral symbols.
Iterate through the mapping in descending order of values and build the Roman numeral representation.
Subtract the largest possible value from the integer at each step and append the corresponding Roman numeral symbol.
Repeat until the integer becomes 0.
Round duration - 45 Minutes
Round difficulty - Medium
Given a positive integer N
, find the number of ways to express N
as a sum of cubes of two integers, A
and B
, such that:
N = A^3 + B^3
Ensure you adhere to the following c...
The problem involves finding the number of ways to express a given positive integer as a sum of cubes of two integers.
Iterate through all possible values of A and B within the given constraints.
Check if A^3 + B^3 equals the given N, increment the count if true.
Handle the case where A = B separately to avoid counting duplicates.
You are given a set of 'N' stones, each with a specific weight and color. The goal is to fill a knapsack with exactly 'M' stones, choosing one stone of each color, so that the to...
The Colorful Knapsack Problem involves selecting one stone of each color to fill a knapsack with a given weight capacity, minimizing unused capacity.
Iterate through the stones and keep track of the minimum weight for each color.
Use dynamic programming to find the optimal solution by considering all possible combinations.
Handle cases where the knapsack cannot be filled under the given conditions by returning -1.
In the g...
Round duration - 15 Minutes
Round difficulty - Easy
Tip 1 : Clear all the topics related to Android with deep details about every topics.
Tip 2 : Practice DSA and algorithms from GFG, CodeStudio daily.
Tip 3 : Dry run code before running the code.
Tip 1 : Mention your open source contributions/ participation in hackathons.
Tip 2 : Provide links to your projects.
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Product Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Front end Developer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Android Developer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Full Stack Developer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Manager Marketing
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Razorpay
Paytm
PhonePe
Mobikwik