Filter interviews by
I applied via Naukri.com and was interviewed before Jan 2020. There was 1 interview round.
I applied via Walk-in and was interviewed before Sep 2019. There were 3 interview rounds.
Top trending discussions
I appeared for an interview before Jan 2021.
Round duration - 90 Minutes
Round difficulty - Medium
This was an online coding round where we had 2 questions to solve under 90 minutes . Both the questions were of easy to medium difficulty .
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iterate to calculate subsequent Fibonacci numbers.
Time complexity can be optimized to O(N) using dynamic programming.
Example: For N = 5, the 5th Fibonacci number is 5.
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...
Find all paths in a binary tree where the sum of node values equals a given value 'K'.
Traverse the binary tree using depth-first search (DFS) and keep track of the current path and its sum.
When reaching a leaf node, check if the sum equals 'K' and add the path to the result.
Continue DFS traversal for both left and right children, passing updated path and sum.
Return the list of paths that sum up to 'K'.
Round duration - 60 Minutes
Round difficulty - Medium
This was a standard DSA round where I was asked to solve 1 question and also code it in a production ready manner . I was also asked 2 puzzles in this round to check my problem solving skills . This round ended with some basic concepts from DBMS and I was also asked some queries related to SQL .
Reverse a given stack of integers using recursion. You must accomplish this without utilizing extra space beyond the internal stack space used by recursion. Additionally, you ...
Reverse a given stack of integers using recursion without using extra space or loop constructs.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order using recursion.
Base case of recursion should be when the original stack is empty.
Race horses in groups of 5, then race the winners to determine the top 3 fastest horses.
Divide the 25 horses into 5 groups of 5 horses each.
Race the horses in each group to determine the fastest horse in each group.
Race the winners from each group to determine the top 3 fastest horses.
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity. Denormalization is the opposite process, adding redundancy to improve read performance.
Normalization involves breaking down a table into smaller tables and defining relationships between them to reduce redundancy.
Denormalization involves combining tables to reduce the number of joins needed for queries, improv...
Primary key uniquely identifies a record in a table, while unique key ensures no duplicate values in a column.
Primary key is used to uniquely identify each record in a table
Primary key does not allow NULL values
Unique key ensures that all values in a column are unique
Unique key allows NULL values, except for the column with unique constraint
A table can have only one primary key, but multiple unique keys
Left Outer Join includes all records from the left table and matching records from the right table. Right Outer Join includes all records from the right table and matching records from the left table.
Left Outer Join returns all records from the left table and the matched records from the right table. Unmatched records from the right table will have NULL values.
Right Outer Join returns all records from the right table a...
To find the second highest salary in a table, you can use a SQL query with the ORDER BY and LIMIT clauses.
Use a SQL query to select the distinct salaries in descending order: SELECT DISTINCT salary FROM table_name ORDER BY salary DESC
Use the LIMIT clause to retrieve the second row: LIMIT 1,1
Combine both queries to find the second highest salary: SELECT DISTINCT salary FROM table_name ORDER BY salary DESC LIMIT 1,1
Round duration - 30 Minutes
Round difficulty - Easy
This was a typical HR round with some standard Behavioral questions like my interests, weaknesses, strengths, family background, why Amdocs, CEO of Amdocs etc.
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.
posted on 20 Jan 2015
The code inserts a given string at the specified position in a compact data structure that stores strings sequentially.
To insert the string at the ith place, we need to shift all the strings after the ith position by the length of the new string.
We can use a loop to iterate through the data structure and find the ith position.
After finding the ith position, we can calculate the new length of the data structure and allo...
Constructing parse tree for ((a+b)*c)/d using data structures.
Use stack data structure to keep track of operators and operands.
Start with the innermost parentheses and work outwards.
Create a node for each operator and operand and link them together.
The root node will be the final result of the expression.
Example: ((a+b)*c)/d can be represented as / -> * -> + -> a, b, c, d.
Merge 'n' identical linked lists from 'n' salespersons to handle insertions, deletions, and updates.
Iterate through each linked list and merge them into a single linked list
Handle insertions, deletions, and updates by traversing the merged list and making necessary changes
Repeat the process for the next day by resetting the merged list
I applied via Campus Placement
based on 32 reviews
Rating in categories
Video Editor
37
salaries
| ₹2 L/yr - ₹3.8 L/yr |
Senior Content Editor
10
salaries
| ₹5.2 L/yr - ₹11.1 L/yr |
Team Lead
7
salaries
| ₹3 L/yr - ₹7 L/yr |
Content Moderator
6
salaries
| ₹2.9 L/yr - ₹3.6 L/yr |
Content Specialist
6
salaries
| ₹2.5 L/yr - ₹7 L/yr |
JioSaavn
Gaana
Wynk
Amazon MX Player