i
Filter interviews by
posted on 4 Apr 2023
I applied via campus placement at Lovely Professional University (LPU) and was interviewed before Apr 2022. There were 4 interview rounds.
Implementing 2 stacks with optional approach
Two stacks can be implemented in a single array by dividing it into two halves
Optional approach can be implemented by using a third parameter to indicate which stack to use
Push and pop operations can be performed on both stacks independently
Top trending discussions
posted on 7 Oct 2022
I applied via Referral and was interviewed in Sep 2022. There were 2 interview rounds.
15 MCQs and 2 coding questions were given. MCQs include questions from topics like dbms, system design, oops etc.
1st coding question was of dp and 2nd was of a good question of graph.
Create and delete a node in a linked list and print the updated list.
Create a Node class with data and next pointer attributes
Create a LinkedList class with head attribute and methods to add, delete and print nodes
To delete a node, traverse the list and update the next pointer of the previous node to skip the node to be deleted
Print the list by traversing and printing the data of each node
Reverse the first K characters of a given string.
Take the first K characters of the string.
Reverse the selected substring.
Concatenate the reversed substring with the rest of the original string.
posted on 23 Sep 2022
I applied via Job Fair and was interviewed in Aug 2022. There were 4 interview rounds.
This round contained 2 coding questions.
posted on 16 Mar 2022
I was interviewed in Feb 2022.
3 coding question 1 SQL query
Find the first repeated element in an array of strings in O(n) time complexity.
Create a hash table to store the frequency of each element.
Traverse the array and check if the element is already present in the hash table.
If it is present, return the element as the first repeated element.
If no element is repeated, return null or -1.
Example: ['apple', 'banana', 'orange', 'apple'] => 'apple'
Question about finding complexity of multiplying big integers.
Big integers require more memory and processing power than regular integers.
Multiplying two n-digit integers takes O(n^2) time using the standard algorithm.
There are faster algorithms like Karatsuba and FFT which have lower complexity.
The complexity of multiplying two n-digit integers using Karatsuba algorithm is O(n^log2(3)).
The complexity of multiplying tw...
I have worked on various projects including developing web applications, creating mobile apps, and implementing machine learning algorithms.
Developed a web application for a retail company to manage inventory and sales data
Created a mobile app for a fitness tracking platform to track user's exercise routines
Implemented machine learning algorithms for a recommendation system in an e-commerce website
Had a overall personality, technical & problem solving test with AVP
posted on 5 Jun 2024
I applied via Approached by Company and was interviewed in Jul 2024. There were 3 interview rounds.
Normal DSA round from hacker rank
DSA round from hacker rank or leetcode
posted on 10 Jan 2025
MVVM was asked and swift questions
Some of the top questions asked at the Open Financial Technologies Private Limited SDE (Software Development Engineer) interview -
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Engineer
79
salaries
| ₹4 L/yr - ₹14 L/yr |
Senior Software Engineer
47
salaries
| ₹11.5 L/yr - ₹31.5 L/yr |
Business Development Specialist
24
salaries
| ₹4 L/yr - ₹10.5 L/yr |
Product Support Engineer
23
salaries
| ₹1.5 L/yr - ₹10 L/yr |
Product Manager
22
salaries
| ₹15 L/yr - ₹32 L/yr |
Tata Group
Reliance Industries
Infosys
Wipro