Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Oriserve Backend Developer Interview Questions and Answers

Updated 16 Sep 2024

Oriserve Backend Developer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Duplicate element in array
  • Ans. 

    Find and return the duplicate element in an array of strings.

    • Iterate through the array and keep track of elements seen so far using a hash set.

    • If an element is already in the hash set, return it as the duplicate element.

    • Example: ['apple', 'banana', 'apple', 'orange'] should return 'apple' as the duplicate element.

  • Answered by AI
  • Q2. Async await in js
  • Ans. 

    async await in JavaScript is a way to write asynchronous code in a synchronous manner.

    • async functions return a Promise

    • await keyword is used to pause the execution of async functions until a Promise is settled

    • async/await makes asynchronous code easier to read and write compared to using callbacks or Promises

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

I applied via LinkedIn and was interviewed in Apr 2021. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. 1. Mininum cost to reach the last cell of a 2D matrix. Required moves are only downward or to the right direction
  • Ans. 

    Minimum cost to reach last cell of 2D matrix with only downward or right moves.

    • Use dynamic programming approach to solve the problem.

    • Calculate minimum cost for each cell by considering minimum cost of its adjacent cells.

    • Final answer will be the minimum cost to reach the last cell.

  • Answered by AI
  • Q2. Design a Stack that can support getMin functionality. Whenever it calls getMin on stack it should return the min element in the stack.
  • Ans. 

    Design a stack that supports getMin functionality to return the minimum element in the stack.

    • Create two stacks, one for storing the actual elements and another for storing the minimum elements.

    • Push elements onto both stacks simultaneously.

    • When popping an element, pop from both stacks.

    • To get the minimum element, peek at the top of the minimum stack.

  • Answered by AI
  • Q3. Design a TreeSet functionality
  • Ans. 

    TreeSet is a data structure that stores unique elements in sorted order.

    • TreeSet is implemented using a Red-Black tree

    • It provides O(log n) time complexity for basic operations like add, remove, and contains

    • It also provides methods like first(), last(), headSet(), tailSet(), and subSet()

    • TreeSet can be used to implement priority queues and sorting algorithms

  • Answered by AI
  • Q4. Design a ArrayList that supprorts all the existing funtions of a list plus getMax functionality also.
  • Ans. 

    Design an ArrayList with getMax functionality.

    • Create a custom ArrayList class that extends the existing ArrayList class.

    • Add a getMax() method that returns the maximum value in the list.

    • Override the add() method to keep track of the maximum value in the list.

    • Update the maximum value whenever an element is added or removed from the list.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice Data Structures and algorithms. If you have industry experience you will be asked system design questions as well, migh as well prepare for that

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Java threads concepts and its usage
  • Q2. Data structures problems and design quentions
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - Coding Test 

-----.geeksforgeeks.org/replace-every-element-with-the-greatest-on-right-side/amp/



-----/

Interview Preparation Tips

Topics to prepare for Paytm Backend Developer interview:
  • DSA
  • Core java
  • Design Patterns
  • Spring Boot
Interview preparation tips for other job seekers - DSA , Design Patters , Core Java Concepts , Springboot
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Jan 2024. There was 1 interview round.

Round 1 - Coding Test 

Given two soted arrays merge them from a single sorted array with all items in non-decreassing order

Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
Selected Selected
Round 1 - HR 

(1 Question)

  • Q1. Human resources is tha set of people who make up the workforce of an organisation, business sector, industry.
Round 2 - Technical 

(2 Questions)

  • Q1. Connected with the partical use of machines, etc. in science and industry
  • Q2. Connected with the skills involved in a particular activity or subject

Interview Preparation Tips

Interview preparation tips for other job seekers - It was great here☺️

I applied via Campus Placement

Interview Preparation Tips

Round: Resume Shortlist
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.

Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix

Tips: All question were from geeksforgeeks
So practice it well ..u will make through it

Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible

Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...

Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens

Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.

  • Q1. 

    K-th Largest Number in a BST

    Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.

    If there is no K-th la...

  • Ans. 

    Find the K-th largest element in a BST.

    • Perform reverse in-order traversal of the BST to find the K-th largest element.

    • Keep track of the count of visited nodes to determine the K-th largest element.

    • Return -1 if there is no K-th largest element in the BST.

  • Answered by AI
  • Q2. 

    Is Height Balanced Binary Tree Problem Statement

    Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:

    1. The left subtree is balanced.
    2. The right subtree is bala...
  • Ans. 

    Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.

    • Check if the left subtree is balanced

    • Check if the right subtree is balanced

    • Calculate the height difference between the left and right subtrees

    • Return 'True' if all conditions are met, otherwise return 'False'

  • Answered by AI
  • Q3. Can you explain the concepts of Zombie Process and Orphan Process in operating systems?
  • Ans. 

    Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.

    • Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.

    • Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.

    • Orphan p...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .

  • Q1. 

    Longest Substring Without Repeating Characters Problem Statement

    Given a string S of length L, determine the length of the longest substring that contains no repeating characters.

    Example:

    Input:
    "abac...
  • Ans. 

    Find the length of the longest substring without repeating characters in a given string.

    • Use a sliding window approach to keep track of the longest substring without repeating characters.

    • Use a hashmap to store the index of each character in the string.

    • Update the start index of the window when a repeating character is found.

    • Calculate the maximum length of the window as you iterate through the string.

    • Return the maximum le

  • Answered by AI
  • Q2. 

    Problem: Search In Rotated Sorted Array

    Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...

  • Ans. 

    Search for integers in a rotated sorted array efficiently.

    • Use binary search to efficiently search for integers in the rotated sorted array.

    • Handle the rotation of the array while performing binary search.

    • Return the index of the integer if found, else return -1.

  • Answered by AI
  • Q3. 

    Count Subarrays with Sum Divisible by K

    Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.

    Input:

    The first line of input contains an...
  • Ans. 

    Count subarrays with sum divisible by K in an array.

    • Iterate through the array and keep track of the prefix sum modulo K.

    • Use a hashmap to store the frequency of each prefix sum modulo K.

    • For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.

    • Handle the case when prefix sum itself is divisible by K.

    • Return the total count of subarrays with sum divisible by K.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.

  • Q1. 

    Ceil Value from BST Problem Statement

    Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.

    The ceil of an integer is defined as the s...

  • Ans. 

    Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.

    • Traverse the BST to find the closest value greater than or equal to the key.

    • Compare the key with the current node value and update the ceil value accordingly.

    • Recursively move to the left or right subtree based on the comparison.

    • Return the ceil value once the traversal is complete.

  • Answered by AI
  • Q2. 

    Design a Constant Time Data Structure

    Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:

    1. INSERT(key, value): Add or update t...
  • Ans. 

    Design a constant time data structure to maintain mappings between keys and values with various operations.

    • Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.

    • Keep track of the number of key-value pairs for GET_SIZE operation.

    • Check if the hash table is empty for IS_EMPTY operation.

    • Return true or false for SEARCH operation based on key existence.

    • Return the value associated...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

I found the online coding round of Flipkart to be quite difficult based on the constraints of the problem and their time limits. I coded the first problem quite easily but on the second and the third problem , my code could only pass a few test cases and gave TLE for most of them. Both the questions required very efficient solution and the last 5 to 10 Test Cases carried more weight than the rest so I didn't get through this round.

  • Q1. 

    Print the Kth Digit

    Given three non-negative integers N, M, and K, compute the Kth digit from the right in the number obtained from N raised to the power M (i.e., N ^ M).

    Input:

    The first line contains ...
  • Ans. 

    The task is to find the Kth digit from the right in the number obtained from N raised to the power M.

    • Iterate through the digits of N^M from right to left

    • Keep track of the position of the current digit

    • Return the digit at position K from the right

  • Answered by AI
  • Q2. 

    The Skyline Problem

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...

  • Ans. 

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.

    • Iterate through the buildings and create a list of critical points (x, y) where the height changes.

    • Sort the critical points based on x-coordinate and process them to form the skyline.

    • Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

    • Return the fin...

  • Answered by AI
  • Q3. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    Identify the longest palindromic substring in a given string.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found

    • Return the longest palindrome with the smallest start index

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Questionnaire 

9 Questions

  • Q1. Write a regex for email validation?
  • Ans. 

    Regex for email validation

    • Start with a string of characters followed by @ symbol

    • Followed by a string of characters and a period

    • End with a string of characters with a length of 2-6 characters

    • Allow for optional subdomains separated by periods

    • Disallow special characters except for . and _ in username

  • Answered by AI
  • Q2. Parse the XML? and store the output in JSON. Discussed different approaches?
  • Q3. Print prime numbers in a given range and optimize the solution?
  • Ans. 

    Print prime numbers in a given range and optimize the solution.

    • Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently

    • Start with a boolean array of size n+1, mark all as true

    • Loop through the array and mark all multiples of each prime as false

    • Print all the indexes that are still marked as true

  • Answered by AI
  • Q4. Puzzle – 25 horses – 5 lanes, find fastest 3 horses?
  • Q5. Web related questions on Sessions and cookies?
  • Q6. A lot of discussion on my resume, experience etc
  • Q7. Find angle between hour hand and minute hand in clock if time is given? Write a program or pseudo code?
  • Ans. 

    Find angle between hour and minute hand in a clock given the time.

    • Calculate the angle made by the hour hand with respect to 12 o'clock position

    • Calculate the angle made by the minute hand with respect to 12 o'clock position

    • Find the difference between the two angles and take the absolute value

    • If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle

  • Answered by AI
  • Q8. A hash function was written to convert a string into a hash. Write a un-hash function to revert it(from hash to string)?
  • Ans. 

    To un-hash a string, use a reverse algorithm to convert the hash back to the original string.

    • Create a reverse algorithm that takes the hash as input and outputs the original string

    • Use the same logic as the hash function but in reverse order

    • If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string

  • Answered by AI
  • Q9. He discussed about expectations and role. Asked me if I have any questions. He said to me “yaha aana hai to marwani padegi. tyar ho”? I smiled and asked what are the work timings? He said 9-9 and I was kin...

Interview Preparation Tips

General Tips: I applied through a recruiter. Then I got a call from Zomato HR. It was for LAMP developer profile. She asked me about my profile and also shared some expectations from the role. She asked me to come for F2F rounds to take the process further
Skills: Web development, JSON, Algorithm
College Name: na
Motivation: Overall process was not very tough. But they have start up culture. People work their for 11-12 hours a day. Sometimes on Saturday as well. So people who are geeks or have nothing in life to do except their job can go and join

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Oriserve Interview FAQs

How many rounds are there in Oriserve Backend Developer interview?
Oriserve interview process usually has 1 rounds. The most common rounds in the Oriserve interview process are Technical.
What are the top questions asked in Oriserve Backend Developer interview?

Some of the top questions asked at the Oriserve Backend Developer interview -

  1. duplicate element in ar...read more
  2. async await in...read more

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

Oriserve

No Interviews

INTERVIEWS

Cloudera

No Interviews

SALARIES

Regami Solutions

INTERVIEWS

Regami Solutions

No Interviews

JOBS

Regami Solutions

No Jobs

SALARIES

Oriserve

INTERVIEWS

Cloudera

10 top interview questions

SALARIES

Brillo Technologies

Tell us how to improve this page.

Oriserve Backend Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
Oriserve Backend Developer Salary
based on 5 salaries
₹8 L/yr - ₹12 L/yr
13% more than the average Backend Developer Salary in India
View more details

Oriserve Backend Developer Reviews and Ratings

based on 1 review

1.0/5

Rating in categories

-

Skill development

-

Work-life balance

-

Salary

-

Job security

-

Company culture

-

Promotions

-

Work satisfaction

Explore 1 Review and Rating
Software Engineer
18 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Analyst
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Software Engineer
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Scientist
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Oriserve with

Zomato

3.8
Compare

Swiggy

3.8
Compare

BigBasket

3.9
Compare

Blinkit

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