i
OneCode
Filter interviews by
I applied via LinkedIn and was interviewed in Dec 2022. There were 5 interview rounds.
Design a marketing campaign
I applied via Recruitment Consulltant and was interviewed in Mar 2022. There were 3 interview rounds.
The best time to sell and buy stocks is when the price is low and expected to rise.
Buy stocks when the price is low and expected to rise
Sell stocks when the price is high and expected to fall
Use technical analysis and market trends to make informed decisions
Find the longest substring without repeating characters in an array of strings.
Iterate through each string in the array
For each string, use a sliding window approach to find the longest substring without repeating characters
Keep track of the longest substring found so far
Return the longest substring found
To delete the middle node of a linked list, we need to find the middle node and remove it.
Traverse the linked list to find the middle node using two pointers
Remove the middle node by updating the previous node's next pointer to the next node
Handle edge cases like even/odd number of nodes and list with only one node
Basic but tricky, you need to get the flow of the long question then yon can easily crack it
Brute force and the optimised approach should be done.
Top trending discussions
I applied via Recruitment Consulltant and was interviewed in Apr 2024. There were 2 interview rounds.
You should be familiar with core java features. Collections, converting one collection Array / Vector to other. Removing duplicates. Lambda chaining / Functional programming. Basic SQL - Joins, Aggregates etc.
I applied via Recruitment Consulltant and was interviewed in Dec 2023. There was 1 interview round.
Reconciliation in AEPS involves matching the transactions between the bank and the service provider to ensure accuracy.
Reconciliation involves comparing the transactions recorded by the bank with those recorded by the service provider.
Any discrepancies are identified and resolved to ensure accurate financial records.
Reconciliation helps in detecting errors, fraud, or any other discrepancies in the transactions.
Examples...
I applied via Campus Placement and was interviewed before Nov 2023. There was 1 interview round.
1hr aptitude + coding
Find the next greater element in an array for each element
Iterate through the array and for each element, find the next greater element
Use a stack to keep track of elements whose next greater element is not yet found
If the current element is greater than the top element of the stack, pop the stack and mark the popped element's next greater element as the current element
Push the current element onto the stack
If there ar...
I was interviewed in Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
Started with projects discussion and internships and moved forward with coding problems.
It started at around 6:00 PM and lasted for 90 minutes approximately
The interviewer was very cool, he even gave me some tips on improving myself further at the end of the interview.
Given a string S
of length N
and an integer K
, find the length of the longest substring that contains at most K
distinct characters.
The first...
Find the length of the longest substring with at most K distinct characters in a given string.
Use a sliding window approach to keep track of the characters and their counts within the window.
Maintain a hashmap to store the characters and their frequencies.
Update the window size and characters count as you iterate through the string.
Return the maximum window size encountered for each test case.
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.
Ninja wants to travel from his house to his best friend's house. The locations of the houses are on a 2D coordinate plane, where Ninja's house is located at the origin (0...
Determine if Ninja can reach his friend's house with even x-coordinate without using modulus operator.
Check if the x-coordinate is even or odd by using bitwise AND operation with 1.
Return 1 if x-coordinate is even, else return 0.
Handle multiple test cases by iterating through each input.
Round duration - 60 minutes
Round difficulty - Easy
I was asked a coding question then, a system design question and some basic operating systems and oops questions
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Time complexity can be optimized to O(N) using a set to store seen elements.
Designing a Google Search Engine involves creating a web crawler, indexing system, and ranking algorithm.
Develop a web crawler to discover and retrieve web pages.
Implement an indexing system to store and organize the content of web pages.
Design a ranking algorithm to determine the relevance of search results.
Include features like autocomplete, spell check, and personalized search results.
Optimize for speed and scalabil...
Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms
Tip 1 : Mention your projects
Tip 2 : Mention your internships
I was interviewed in Mar 2022.
Round duration - 90 minutes
Round difficulty - Medium
Only Java allowed
Given an integer array ARR
of size N
containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...
Sort an array of 0s and 1s in linear time without using additional arrays.
Iterate through the array and maintain two pointers, one for 0s and one for 1s.
Swap elements at the two pointers based on the current element being 0 or 1.
Continue this process until the entire array is sorted in place.
Round duration - 60 minutes
Round difficulty - Easy
Basic intro and coding questions
An integer N
is provided, and the task is to determine if N
is a perfect square. A perfect square refers to an integer which can be expressed as the square of another integer.
Implement a function to check if a given integer is a perfect square.
Create a function that takes an integer as input and returns true if it is a perfect square, false otherwise.
Iterate through possible square roots of the input integer and check if the square of the root equals the input.
Return true if a perfect square is found, false otherwise.
Given a sequence of numbers 'ARR', your task is to return a sorted sequence of 'ARR' in non-descending order using the Merge Sort algorithm.
ARR = [5, 3, 8,...
Implement Merge Sort algorithm to sort a given sequence of numbers in non-descending order.
Merge Sort is a divide-and-conquer algorithm that splits the array into two halves, recursively sorts each half, and then merges the sorted halves back together.
Time complexity of Merge Sort is O(n log n) in the worst case scenario.
It is a stable sorting algorithm, meaning that the relative order of equal elements is preserved.
Ex...
Round duration - 60 minutes
Round difficulty - Medium
More difficult than the previous round
Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...
The task is to print the bottom view of a binary tree from left to right.
Traverse the binary tree in level order and keep track of the horizontal distance of each node from the root.
Store the nodes at each horizontal distance in a map, updating it as you traverse the tree.
After traversal, extract the bottom-most nodes at each horizontal distance to get the bottom view sequence.
Round duration - 70 minutes
Round difficulty - Medium
There were no DSA questions. My interviews were based on android app development. The interviewer presented scenarios and asked how will you solve them. No particular correct answer was expected just the best approach as per me.
Implement multiple RecyclerViews on a magnified screen in an Android app by adjusting item sizes and spacing.
Adjust item sizes and spacing based on screen magnification level
Use nested RecyclerViews or custom layouts to display multiple lists
Implement custom item decorators to manage spacing between RecyclerViews
Consider using a GridLayoutManager with custom span sizes for each RecyclerView
Implementing cart functionality in an e-commerce application involves managing user interactions, updating quantities, handling discounts, and processing orders.
Create a data structure to store cart items, quantities, and prices.
Implement add to cart, remove from cart, and update quantity functionalities.
Handle discounts, promotions, and coupon codes.
Calculate total price, including taxes and shipping costs.
Implement c...
Round duration - 30 minutes
Round difficulty - Easy
HR asked questions about why Mobikwik, what's your goal, how are you a good fit, etc.
Tip 1 : Prepare advanced array questions
Tip 2 : Trees basic to medium questions
Tip 3 : Optimize solutions
Tip 1 : Internship experience
Tip 2 : Personal Projects (remember proper details)
based on 1 interview
Interview experience
Senior Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Partner
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Content Writer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Officer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
PhonePe
Mobikwik
Freecharge