Filter interviews by
Create a pattern logic using arrays of strings
Start by defining the pattern you want to create
Use loops and conditional statements to generate the pattern
Test the pattern with different inputs to ensure it works correctly
I applied via Campus Placement and was interviewed in May 2023. There were 3 interview rounds.
Aptitude test + 2 questions one on DSA and other on Rest api
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
There were 2 coding questions and 8 mcq
level - HIGH
I appeared for an interview before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
Given 'N' students standing in a row with specific heights, your task is to find the length of the longest strictly increasing subsequence of their heights...
Find the length of the longest strictly increasing subsequence of heights of students in a row.
Iterate through the heights array and for each element, find the length of the longest increasing subsequence ending at that element.
Use dynamic programming to keep track of the longest increasing subsequence length for each element.
Return the maximum length found as the result.
You are given the start and end times of 'N' intervals. Write a function to determine if any two intervals overlap.
If an interval ends at time T and anothe...
Given start and end times of intervals, determine if any two intervals overlap.
Iterate through intervals and check if any two intervals overlap by comparing their start and end times
Sort intervals based on start times for efficient comparison
Consider edge cases where intervals end and start at the same time
Various SQL queries related to data manipulation and retrieval were asked during the interview.
Basic SELECT queries to retrieve data from a single table
JOIN queries to retrieve data from multiple tables based on a common column
Aggregate functions like COUNT, SUM, AVG, etc. to perform calculations on data
Subqueries to retrieve data based on the result of another query
UPDATE queries to modify existing data in a table
DELE...
Round duration - 60 Minutes
Round difficulty - Medium
Given a string STR
of size N
and an integer M
representing the number of rows in the zig-zag pattern, return the string formed by concatenating all rows when the string ST...
Arrange a string in zig-zag pattern with given number of rows and concatenate the rows.
Iterate through the string and distribute characters to rows based on zig-zag pattern
Concatenate the characters in each row to get the final result
Handle edge cases like when number of rows is 1 or equal to the length of the string
You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...
The task is to rearrange a given permutation of 'N' integers to form the lexicographically next greater permutation.
Iterate from right to left to find the first element that is smaller than the element to its right.
Swap this element with the smallest element to its right that is greater than it.
Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.
Round duration - 60 Minutes
Round difficulty - Medium
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
String S
Output string
Recursively remove consecutive duplicate characters from a string.
Use recursion to check if the current character is the same as the next character, if so skip the next character
Base case: if the string is empty or has only one character, return the string
Example: Input: 'aaabcc', Output: 'abc'
Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.
The first and only line of input ...
Return all possible permutations of a given input string.
Use recursion to generate all possible permutations of the input string.
Swap characters at different positions to generate permutations.
Handle duplicate characters in the input string by using a set to store unique permutations.
Round duration - 60 Minutes
Round difficulty - Medium
Design an e-commerce website similar to Flipkart or Amazon.
Implement user-friendly interface for easy navigation
Include search functionality with filters for products
Incorporate secure payment gateway for transactions
Provide personalized recommendations based on user behavior
Include customer reviews and ratings for products
Implement order tracking and delivery status updates
Offer various payment options like credit/deb
Tip 1 : Prepare DSA well. Standard Leetcode-type questions will be asked.
Tip 2 : You should be crystal clear about your project/s as any question would be asked and you should be able to answer it.
Tip 3 : Prepare CS fundaments like OS, OOPs, DBMS, etc.
Tip 1 : Clearly mention the tech. stack you have worked on in the project/s
Tip 2 : As a fresher, you should add your coding profiles on CodeChef, Codeforces, etc. so as to make the resume shortlisting easy
I applied via LinkedIn and was interviewed in Mar 2021. There were 3 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 120 Minutes
Round difficulty - Easy
The round was conducted in day around 3PM.
Given an array ARR
consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...
The problem is to determine if it is possible to partition an array into two subsets with equal sum.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the results of subproblems.
Check if the sum of the array is even before attempting to partition it.
Iterate through the array and update the 2D array based on the sum of subsets.
Return true if a subset with half the sum is found, false ot
Round duration - 30 Minutes
Round difficulty - Easy
The interview was preponed and was conducted at 9AM.
The interviewer was friendly and I had saw him earlier at pre-placement talk.
Given a string STR
, your task is to remove spaces from STR
and convert it to Pascal case format. The function should return the modified STR
.
In Pascal case, words are con...
Convert a given string to Pascal case format by removing spaces and capitalizing the first letter of each word.
Iterate through each character in the string
If the character is a space, skip it
If the character is not a space and the previous character is a space or it is the first character, capitalize it
SQL query to retrieve the Nth highest salary from a database
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to retrieve the Nth highest salary
Consider handling cases where there might be ties for the Nth highest salary
Round duration - 30 Minutes
Round difficulty - Easy
This round was conducted 15mins after 1st round.
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...
Remove the Kth node from the end of a singly linked list.
Traverse the list to find the length 'N'.
Calculate the position of the node to be removed from the beginning as 'N - K + 1'.
Remove the node at the calculated position.
Handle edge cases like removing the head or tail of the list.
Update the pointers accordingly after removal.
Tip 1 : Do Competitive Coding
Tip 2 : Learn at least 1 framework
Tip 3 : Build interest in computers
Tip 1 : Be well informed of everything you mention in your resume
Tip 2 : Mention competitive coding achivements in your resume(if any)
I appeared for an interview before Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
This was an online proctured coding test where we had 2 questions to solve under 60 minutes. The questions were of Easy to Medium level.
You are provided with a string EXP
which represents a valid infix expression. Your task is to convert this given infix expression into a postfix expression.
An i...
Convert a given infix expression to a postfix expression.
Use a stack to keep track of operators and operands
Follow the rules of precedence for operators
Convert the infix expression to postfix using the stack
Handle parentheses by pushing them onto the stack and popping when necessary
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input beg...
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
Iterate through the array and maintain a count of 0s and 1s encountered so far.
Store the count difference in a hashmap with the index as the key.
If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.
Round duration - 60 Minutes
Round difficulty - Medium
In this round, the interviewer asked me 2 questions related to DSA and then some questions from OS were asked to check basic understanding of the subject.
Given a string S
, your task is to return all distinct palindromic substrings of the given string in alphabetical order.
A string is considered a pal...
Return all distinct palindromic substrings of a given string in alphabetical order.
Iterate through all possible substrings of the given string
Check if each substring is a palindrome
Store distinct palindromic substrings in alphabetical order
You are given a binary tree consisting of distinct integers and two nodes, X
and Y
. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other.
Consider edge cases like when X or Y is the root node.
Implement a recursive or iterative solution to find the LCA efficiently.
Mutex is used for exclusive access to a resource, while semaphore is used for controlling access to a resource by multiple threads.
Mutex is binary and allows only one thread to access the resource at a time.
Semaphore can have a count greater than one, allowing multiple threads to access the resource simultaneously.
Mutex is used for protecting critical sections of code, while semaphore is used for synchronization betwee...
Multitasking involves executing multiple tasks simultaneously, while multiprogramming involves running multiple programs on a single processor.
Multitasking allows multiple tasks to run concurrently, switching between them quickly.
Multiprogramming involves loading multiple programs into memory and executing them concurrently.
Examples of multitasking include running multiple applications on a computer or a smartphone.
Exa...
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 questions from DSA which were followed by some core concepts from OOPS and Java.
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...Merge two sorted linked lists into a single sorted linked list with linear time complexity and constant space usage.
Iterate through both linked lists simultaneously, comparing elements and merging them into a new linked list
Update the pointers of the new linked list as you merge elements from the two input linked lists
Ensure to handle cases where one linked list is empty or both linked lists are empty
Maintain the sorte...
Your task is to sort an array of integers in non-decreasing order using the Heap Sort algorithm.
The first line contains an integer 'T' denoting the number of test cas...
Heap Sort algorithm is used to sort an array of integers in non-decreasing order.
Implement Heap Sort algorithm to sort the array in non-decreasing order.
Use a max heap to sort the array in ascending order.
Time complexity of Heap Sort is O(n log n).
Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.
Abstract class can have constructors, member variables, and methods, while interface cannot have any of these.
A class can extend only one abstract class but can implement multiple interfaces.
Abstract classes are used to provide a common base for subclasses, while interfaces are used to define a contract for cl...
Method overloading is when multiple methods in the same class have the same name but different parameters. Method overriding is when a subclass provides a specific implementation of a method that is already provided by its superclass.
Method overloading allows a class to have multiple methods with the same name but different parameters. For example, having multiple constructors in a class with different parameter lists.
...
Round duration - 30 Minutes
Round difficulty - Easy
This was a typical HR round with some standard Behavioral questions.
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.
I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 4 interview rounds.
Program to reverse a string in minimum iteration
Use two pointers, one at the start and one at the end of the string
Swap the characters at the two pointers and move the pointers towards each other
Repeat until the pointers meet in the middle of the string
I applied via Naukri.com and was interviewed in Apr 2021. There were 4 interview rounds.
Calculate the number of children and grandchildren
Count the number of direct children of a person
Count the number of grandchildren of a person
Use recursion to count all descendants
Consider only living descendants
Exclude step-children and adopted children
Some of the top questions asked at the Oracle Financial Services Software Application Developer interview -
based on 2 interviews
Interview experience
based on 76 reviews
Rating in categories
Senior Consultant
1.3k
salaries
| ₹6 L/yr - ₹21 L/yr |
Staff Consultant
1.1k
salaries
| ₹4.5 L/yr - ₹13.6 L/yr |
Associate Consultant
1k
salaries
| ₹3.3 L/yr - ₹10 L/yr |
Principal Consultant
702
salaries
| ₹8.8 L/yr - ₹29 L/yr |
Application Developer
481
salaries
| ₹6 L/yr - ₹23 L/yr |
Oracle
KPIT Technologies
24/7 Customer
Intellect Design Arena