Filter interviews by
I appeared for an interview in Mar 2024.
Pattern question and .net basisc
Top trending discussions
Code for rand7 using rand5 function
Use rand5 twice to generate a number in [1,25] with equal probability
If the number is greater than 21, discard and try again
Otherwise, return (number mod 7) + 1
I appeared for an interview in Jun 2017.
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions on DSA and OS.
Design and implement a data structure for a Least Recently Used (LRU) cache that supports the following operations:
get(key)
- Retrieve the value associated with the...Design and implement a Least Recently Used (LRU) cache data structure that supports get and put operations with a specified capacity.
Implement a doubly linked list to keep track of the order of keys based on their usage.
Use a hashmap to store key-value pairs for quick access and updates.
When a key is accessed or updated, move it to the front of the linked list to mark it as the most recently used.
When the cache reaches...
Given an array of non-negative integers and an integer K representing the length of a subarray, your task is to determine the maximum elements for each subarray of size ...
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.
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.
Implement LRU cache
LRU stands for Least Recently Used
It is a cache eviction policy that removes the least recently used item
It can be implemented using a doubly linked list and a hash map
Newly accessed items are moved to the front of the list
When the cache is full, the item at the end of the list is removed
Virtual memory is a memory management technique that allows a computer to use more memory than it physically has.
Virtual memory uses a combination of RAM and hard disk space to store data.
It allows programs to use more memory than is physically available.
If a program tries to access memory that is not currently in RAM, it will be swapped in from the hard disk.
Even if we had infinite RAM, virtual memory would still be n...
Find maximum length of subarray where max <= 2*min.
Iterate through array and keep track of max and min values.
Update max length when condition is met.
Time complexity: O(n)
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer called my via phone and simultaneously provided me a link where I had to write the code for a given problem. It was scheduled at 12:30 pm, so timing was not an issue. It was a standard DP question involving a 2D matrix. The question was easy and I was able to code it within given time.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me two coding questions in this round.
Round duration - 60 minutes
Round difficulty - Easy
This was on-site round at their Bangalore office. The interviewer was friendly and helpful. The interview held inside a conference room.
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GR...
Round duration - 60 minutes
Round difficulty - Easy
This was the next round of the onsite interviews. Took place in the same conference room as that of the previous round.
Round duration - 60 minutes
Round difficulty - Easy
This was the third round of the onsite interview.
Practice DP based questions as much as you can. Also, be confident during the interview about your solution. For practice, you can prefer Coding Ninjas and Geeks For Geeks.
Application resume tips for other job seekersKeep it short. Mention the academic and professional projects you've done. Add your educational details properly with percentage or CGPA obtained.
Final outcome of the interviewSelectedI applied via Naukri.com
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
The coding round consisted of 3 coding questions. 1st question was of 20 marks, 2nd and 3rd of 50 marks.
Given an array 'ARR' consisting of 'N' positive integers, determine the minimum number of operations needed to make all elements of the array equal. You may ...
Given an array of obstacles' coordinates, determine the minimal jump length to reach beyond all obstacles starting from coordinate 0 while avoiding landing on any obstacle...
Find the minimal jump length to bypass all obstacles while avoiding landing on any obstacle.
Iterate through the obstacle coordinates to find the maximum coordinate.
Calculate the minimum jump length needed to bypass all obstacles.
Ensure the jump length consistently avoids all obstacle points.
The final jump can overshoot the line's end point.
You are given an unsorted array/list ‘ARR’ of ‘N’ integers. Your task is to return the length of the longest consecutive sequence.
The consecutive sequence ...
Round duration - 45 minutes
Round difficulty - Easy
Timing: 10:15 - 11:00 am.
The interview was online from home.
Round duration - 45 minutes
Round difficulty - Medium
Timing: 2:15 - 3:00 PM
The interview was online from home.
There were a few audio cuts in the video call but we were able to manage regardless.
Given a string STR
containing characters from [a-z], [A-Z], [0-9], and special characters, determine the reverse of the string.
The input starts with a single i...
Reverse a given string containing characters from [a-z], [A-Z], [0-9], and special characters.
Iterate through the characters of the string in reverse order and append them to a new string.
Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.
Handle special characters and numbers along with alphabets while reversing the string.
Ensure to print each reversed string ...
Tip 1 : For OOPS, DS and programming, I recommend Codezen, Leetcode, InterviewBit and GeeksforGeeks.
Tip 2 : For OS, DBMS and Computer Network, I recommend GateSmasher, Knowledge Gate and TutorialsPoint.
Tip 3 : For SQL, I recommend W3Schools and GeeksforGeeks.
Tip 4 : Always maintain your cool during Interviews, and answer the questions calmly. If you get stuck in a problem, do not hesitate to ask for hints.
Tip 1: Mention only those projects and internships in your resume that you are comfortable with, that is, you can explain to the interviewee.
Tip 2: Mention only those skills/programming languages in your resume that you are comfortable with, that is, you have proper knowledge of as the interviewee can ask questions from those languages specifically.
Tip 3: Keep your data in your resume honest and accurate.
I applied via Naukri.com and was interviewed in Oct 2021. There was 1 interview round.
I applied via LinkedIn and was interviewed in Mar 2021. There were 4 interview rounds.
based on 1 interview experience
Difficulty level
Duration
Financial Advisor
105
salaries
| ₹2 L/yr - ₹5 L/yr |
Investment Specialist
15
salaries
| ₹1.7 L/yr - ₹3.6 L/yr |
Software Developer
13
salaries
| ₹2.5 L/yr - ₹7.2 L/yr |
Back Office Executive
7
salaries
| ₹1.5 L/yr - ₹3 L/yr |
Investment Advisor
6
salaries
| ₹0.8 L/yr - ₹2 L/yr |
HDB Financial Services
AU Small Finance Bank
Bajaj Finance
Equitas Small Finance Bank