i
Oportun
Filter interviews by
The first round was a coding test, which was outsourced to an external vendor. I was asked 2 basic DSA questions, and there was discussions around the time and space complexity, and scope of optimizing the solutions. Post that there were a few questions around Spring Boot features and basic system design. The interviewer was professional throughout the interview, and the interview process felt more like a discussion, as compared to the standard interview process.
There was another round of coding - this time conducted by the organization itself. It consisted of a medium level DSA question on stacks. I wrote the code on my personal IDE and executed it there itself. The interviewer discussed about the possible edge cases and how I would deal with them. Post solving the question I was asked about my previous projects.
This was the final round where the discussion was largely around system design and HLD. It started off with questions are system design patterns and concepts. Then I was asked to design a booking design, with discussions around concurrency control and transaction management.
I applied via Company Website and was interviewed in Jun 2024. There were 2 interview rounds.
1 hour - Reverse linked list k at a time
Java 8 stream setup involves creating a stream from a collection or array and applying operations like filter, map, and reduce.
Create a stream from a collection using stream() method
Apply operations like filter, map, and reduce to process elements
Use terminal operations like collect or forEach to get the final result
CAP Theorem states that in a distributed system, it is impossible to simultaneously achieve consistency, availability, and partition tolerance.
Consistency: All nodes in the system have the same data at the same time.
Availability: Every request gets a response, even if some nodes are down.
Partition Tolerance: The system continues to operate despite network partitions.
Examples: MongoDB prioritizes consistency and partiti...
DynamoDB is a fully managed NoSQL database service provided by AWS, designed for high performance and scalability.
DynamoDB is schema-less, allowing for flexible data models
It offers high availability and durability through replication and automatic backups
DynamoDB uses primary keys for data retrieval, with optional secondary indexes for querying
It supports ACID transactions for consistency and reliability
DynamoDB is de...
A function is a standalone block of code that can be called independently, while a method is a function that is associated with a class or object.
Functions are standalone blocks of code, while methods are functions associated with classes or objects.
Functions can be called independently, while methods are called on specific instances of classes or objects.
Functions are defined outside of classes, while methods are defi...
Implement a dynamic programming solution for stock buy and sell problem.
Use dynamic programming to find the maximum profit by buying and selling stocks.
Keep track of the minimum stock price seen so far and update the maximum profit accordingly.
Consider edge cases like no profit or negative profit.
Example: Input [7, 1, 5, 3, 6, 4], Output 5 (buy at 1, sell at 6)
Oportun interview questions for designations
I applied via Referral and was interviewed before Jul 2022. There were 5 interview rounds.
Angular has a life cycle consisting of several phases that a component goes through from creation to destruction.
Angular components go through several life cycle hooks such as ngOnInit, ngOnDestroy, etc.
ngOnInit is called after the component has been initialized and its data-bound properties have been checked.
ngOnDestroy is called just before the component is destroyed.
Other life cycle hooks include ngOnChanges, ngDoCh...
Get interview-ready with Top Oportun Interview Questions
Top trending discussions
I appeared for an interview in Dec 2020.
Round duration - 60 minutes
Round difficulty - Medium
test timing: 7-8 pm
2 programming questions
webcam proctored
You are provided with an array ARR
of integers of size 'N' and an integer 'K'. The goal is to move from the starting index to the end of the array with the minimum possib...
Find minimum cost to reach end of array by jumping with constraints
Use dynamic programming to keep track of minimum cost at each index
Iterate through the array and update the minimum cost based on reachable indices within K steps
Calculate cost to jump from current index to reachable indices and update minimum cost accordingly
Tip 1 : Ability to apply data structures in questions(practice graph and Tree questions)
Tip 2 : Thorough knowledge of the projects done
Tip 3 : Good knowledge about computer science concepts
Tip 1 : Mention projects that you have done yourself and are thorough with
Tip 2 : mention soft skills
posted on 11 Oct 2020
I applied via Naukri.com and was interviewed in Sep 2020. There were 5 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Medium
The test was organized online on Amcat and there were 3 coding problems. There were no MCQs in this round.
Implement a function that determines whether a given numeric string contains any substring whose integer value equals the product of two consecutive integers. The functio...
Implement a function to determine if a numeric string contains a substring whose value equals the product of two consecutive integers.
Iterate through all substrings of the input string and check if their integer value equals the product of two consecutive integers.
Use nested loops to generate all possible substrings efficiently.
Check if the product of two consecutive integers matches the integer value of the substring.
...
Given a binary tree, a target node within this tree, and an integer K
, identify and return all nodes that are exactly K
edges away from the t...
Find nodes at a specific distance from a target node in a binary tree.
Traverse the binary tree to find the target node.
Perform a depth-first search to identify nodes at distance K from the target node.
Return the values of nodes found at distance K in an array.
Round duration - 50 Minutes
Round difficulty - Medium
This round was scheduled by the college Training and Placement team virtually. The interviewer asked me questions pertaining mainly to DSA and we discussed my projects.
You are given the head node of a singly linked list head
. Your task is to modify the linked list so that all the even-valued nodes appear before all the odd-v...
Reorder a singly linked list so that all even-valued nodes appear before odd-valued nodes while preserving the original order.
Create two separate linked lists for even and odd nodes
Traverse the original list and move nodes to respective even or odd lists
Merge the even and odd lists while maintaining the original order
Round duration - 60 Minutes
Round difficulty - Easy
Again, the round was virtual. This was a Tech + Managerial round organized by the college T & P cell. The interviewer asked questions related to fundamental subjects such as Operating Systems, Object-oriented programming, and DBMS. There was one coding round at the end.
Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal.
Consider lines at a...
Diagonal traversal of a binary tree involves printing nodes at 135 degree angle in between lines.
Traverse the tree in a diagonal manner, starting from the root node.
Maintain a map to store nodes at each diagonal level.
Print the nodes at each diagonal level in the order of traversal.
Round duration - 40 Minutes
Round difficulty - Easy
The round was virtual and was organized by the T & P cell of the college. The interviewer asked some behavioural and situation-based questions. There was one puzzle at the end.
Tip 1 : For a product-based company, the first important thing is to solve as many DSA problems as possible. I solved problems mainly on GeeksforGeeks, LeetCode, and Coding Ninjas.
Tip 2 : Prepare 2-3 good projects based on your technical skillset. Prepare it very well as there is a high chance that projects would be discussed in the interview.
Tip 3 : Prepare fundamental college subjects like Operating systems, Object-oriented Programming, Database Management.
Tip 1 : Keep it short and concise
Tip 2 : Describe your projects very specifically
I appeared for an interview in Dec 2017.
To find the maximum water pond formed between buildings.
Identify the lowest point between the buildings.
Calculate the area of the pond using the distance between the buildings and the depth of the pond.
Consider any obstacles or uneven ground that may affect the pond's shape.
Use a surveying tool or satellite imagery to get accurate measurements.
Take into account any drainage systems or natural water flow that may affect
Design a dictionary using trie with insert, update and delete operations.
Implement a Trie data structure with nodes containing a character and a boolean flag to indicate end of word
For insert operation, traverse the trie and add nodes for each character in the word
For update operation, delete the existing word and insert the updated word
For delete operation, mark the end of word flag as false and delete the node if it ...
I applied via Campus Placement
based on 6 interviews
Interview experience
based on 5 reviews
Rating in categories
6-9 Yrs
Not Disclosed
Senior Software Engineer
18
salaries
| ₹26.6 L/yr - ₹40.7 L/yr |
Data Engineer
9
salaries
| ₹12.7 L/yr - ₹19.8 L/yr |
Software Engineer
7
salaries
| ₹23 L/yr - ₹32.3 L/yr |
Senior Software Engineer Testing
7
salaries
| ₹22 L/yr - ₹35 L/yr |
Senior Software Test Engineer
6
salaries
| ₹21 L/yr - ₹25.2 L/yr |
Paytm
Fiserv
PhonePe
KFintech