Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by OneCode Team. If you also belong to the team, you can get access from here

OneCode Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

OneCode Interview Questions and Answers

Updated 7 Jun 2023

OneCode Interview Experiences

Popular Designations

3 interviews found

Senior Designer Interview Questions & Answers

user image Purvi Gupta

posted on 7 Jun 2023

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Dec 2022. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - One-on-one 

(1 Question)

  • Q1. Basic Design question and What I done in past. Design process.
Round 3 - Aptitude Test 

Design a marketing campaign

Round 4 - One-on-one 

(1 Question)

  • Q1. Branding questions. Design process define.
Round 5 - HR 

(1 Question)

  • Q1. Where do to you see yourself in 5yrs? Why design?

Senior Designer Interview Questions asked at other Companies

Q1. How will you design a xyz machine with your machine vision expertise
View answer (1)

I applied via Recruitment Consulltant and was interviewed in Mar 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(4 Questions)

  • Q1. Best time to sell and buy stocks - dsa problem
  • Ans. 

    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

  • Answered by AI
  • Q2. Longest substring without repeating characters - dsa problem
  • Ans. 

    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

  • Answered by AI
  • Q3. Delete the middle node of linked list - dsa problem
  • Ans. 

    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

  • Answered by AI
  • Q4. Questions based on projects
Round 3 - HR 

(4 Questions)

  • Q1. Can you tell me something about yourself?
  • Q2. How's your perfect day look like ?
  • Q3. Why you want to join our company?
  • Q4. How you see yourself after 5 years?

Interview Preparation Tips

Topics to prepare for OneCode Software Engineer interview:
  • Javascript
  • DSA
Interview preparation tips for other job seekers - Stay confident the person who is taking your interview is also human. He/she won't eat you .

Skills evaluated in this interview

Software Engineer Interview Questions asked at other Companies

Q1. Bridge and torch problem : Four people come to a river in the night. There is a narrow bridge, but it can only hold two people at a time. They have one torch and, because it's night, the torch has to be used when crossing the bridge. Person... read more
View answer (196)
Round 1 - Coding Test 

Basic but tricky, you need to get the flow of the long question then yon can easily crack it

Round 2 - Coding Test 

Brute force and the optimised approach should be done.

Round 3 - One-on-one 

Interview Preparation Tips

Interview preparation tips for other job seekers - ....

Software Development Engineer Interview Questions asked at other Companies

Q1. Given an acyclic graph of a city where each edge represents a road in the city and each vertex represents an crossing. Write an algo to find out the minimum number of vertices at which a policemen will be kept so that all the roads are cove... read more
View answer (2)

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Normal java and sql question
Round 3 - Technical 

(1 Question)

  • Q1. Sping boot and microservice

Interview Preparation Tips

Interview preparation tips for other job seekers - Be prepared
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed in Apr 2024. There were 2 interview rounds.

Round 1 - Coding Test 

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.

Round 2 - One-on-one 

(1 Question)

  • Q1. Explain Architecture of applications you worked on. Justify use of components. System Design questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - No need to grind leet code here. But you should know how to solve day to day problems. Do projects end to end. You should know the backend well.
Interview experience
2
Poor
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Recruitment Consulltant and was interviewed in Dec 2023. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. How does reconciliation happens in AEPS
  • Ans. 

    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...

  • Answered by AI
  • Q2. Tell me about yourself
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Nov 2023. There was 1 interview round.

Round 1 - Aptitude Test 

1hr aptitude + coding

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(2 Questions)

  • Q1. Next Greater Element in an array
  • Ans. 

    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...

  • Answered by AI
  • Q2. Question based on Sql inner join

Interview Preparation Tips

Interview preparation tips for other job seekers - Solve LC questions and go through HLD design videos

Skills evaluated in this interview

I was interviewed in Mar 2021.

Round 1 - Video Call 

(3 Questions)

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.

  • Q1. 

    Longest Substring with At Most K Distinct Characters

    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.

    Input:

    The first...
  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Maximum Frequency Number Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q3. 

    Ninja and Bombs Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

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

  • Q1. 

    Find Duplicates in an Array

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q2. Can you design a Google Search Engine?
  • Ans. 

    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...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaNo CriteriaMobiKwik interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, System Design, Operating SystemsTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms

Application resume tips for other job seekers

Tip 1 : Mention your projects
Tip 2 : Mention your internships

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Mar 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Only Java allowed

  • Q1. 

    Sort 0 and 1 Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Basic intro and coding questions

  • Q1. 

    Valid Perfect Square Check

    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.

    ...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Merge Sort Problem Statement

    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.

    Example:

    Input:
    ARR = [5, 3, 8,...
  • Ans. 

    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...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

More difficult than the previous round

  • Q1. 

    Bottom View of Binary Tree Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

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.

  • Q1. How would you implement multiple RecyclerViews on a magnified screen in an Android application?
  • Ans. 

    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

  • Answered by AI
  • Q2. How would you implement various activities related to cart functionality in an e-commerce application?
  • Ans. 

    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...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR asked questions about why Mobikwik, what's your goal, how are you a good fit, etc.

Interview Preparation Tips

Eligibility criteriaCGPA - 7 & above, Active backlogs - NoneMobiKwik interview preparation:Topics to prepare for the interview - Basic DSA, Arrays, String, Trees, Problem SolvingTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Prepare advanced array questions
Tip 2 : Trees basic to medium questions
Tip 3 : Optimize solutions

Application resume tips for other job seekers

Tip 1 : Internship experience
Tip 2 : Personal Projects (remember proper details)

Final outcome of the interviewSelected

Skills evaluated in this interview

OneCode Interview FAQs

How many rounds are there in OneCode interview?
OneCode interview process usually has 3-4 rounds. The most common rounds in the OneCode interview process are One-on-one Round, Coding Test and Resume Shortlist.
How to prepare for OneCode interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at OneCode. The most common topics and skills that interviewers at OneCode expect are Illustrator, Photoshop, UX, User Interface Designing and AWS.
What are the top questions asked in OneCode interview?

Some of the top questions asked at the OneCode interview -

  1. Delete the middle node of linked list - dsa prob...read more
  2. Longest substring without repeating characters - dsa prob...read more
  3. Best time to sell and buy stocks - dsa prob...read more

Tell us how to improve this page.

OneCode Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Paytm Interview Questions
3.3
 • 752 Interviews
PhonePe Interview Questions
4.0
 • 299 Interviews
Razorpay Interview Questions
3.6
 • 148 Interviews
Freecharge Interview Questions
3.8
 • 53 Interviews
Mobikwik Interview Questions
3.7
 • 47 Interviews
BharatPe Interview Questions
3.5
 • 38 Interviews
BillDesk Interview Questions
3.2
 • 14 Interviews
Amazon Pay Interview Questions
4.0
 • 13 Interviews
View all

OneCode Reviews and Ratings

based on 16 reviews

3.7/5

Rating in categories

3.8

Skill development

3.3

Work-life balance

3.0

Salary

2.9

Job security

3.0

Company culture

3.3

Promotions

3.4

Work satisfaction

Explore 16 Reviews and Ratings
Senior Software Engineer
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Partner
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Executive
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Content Writer
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Officer
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare OneCode with

Paytm

3.3
Compare

PhonePe

4.0
Compare

Mobikwik

3.7
Compare

Freecharge

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview