Filter interviews by
I was interviewed before Feb 2024.
Rate your
company
🤫 100% anonymous
How was your last interview experience?
I applied via Recruitment Consulltant and was interviewed before May 2022. There were 3 interview rounds.
Versant Test along with other quizzes and tests
Cision interview questions for popular designations
I applied via Company Website and was interviewed in Jan 2022. There were 2 interview rounds.
I applied via Recruitment Consultant and was interviewed in Aug 2020. There were 3 interview rounds.
Top trending discussions
Aptitude test, plus real life scenario questions
I applied via Walk-in and was interviewed in Mar 2024. There was 1 interview round.
Factors of pr refer to the numbers that can be multiplied together to get the number pr.
Factors are numbers that divide evenly into the given number.
For example, factors of 12 are 1, 2, 3, 4, 6, and 12.
Factors can be positive or negative, whole numbers or decimals.
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
The interviewer was really cool. He realized that I mostly work on java applications so he chose to ask me stuff related to that. He didn't want me to know the answer well but just wanted me to approach to it, maybe think more. He went through my resume back and forth and asked mostly about all my projects and their logic and how could I take them to the next level.
Tips: Be confident. Its okay not to know any answer, just try giving it a shot in the approach.
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 with implementation.
Interface can only have abstract methods and constants.
A class can implement multiple interfaces but can only extend one abstract class.
Example: Abstract class - Animal with abstract method 'eat', Interface - Flyable with m
final is a keyword used to declare constants, finally is a block used in exception handling, and finalize is a method used for cleanup.
final is a keyword used to declare constants in Java, meaning the value cannot be changed once assigned. Example: final int x = 10;
finally is a block used in exception handling to ensure a piece of code is always executed, whether an exception is thrown or not. Example: try { // code } ...
Private restricts access to the class itself, while final prevents inheritance and method overriding.
Private access modifier restricts access to the class itself, while final access modifier prevents inheritance and method overriding.
Private members are only accessible within the same class, while final classes cannot be extended and final methods cannot be overridden.
Example: private int num; - num can only be accesse...
Establishing a JDBC connection involves loading the driver, creating a connection, creating a statement, executing queries, and handling exceptions.
Load the JDBC driver using Class.forName() method
Create a connection using DriverManager.getConnection() method
Create a statement using connection.createStatement() method
Execute queries using statement.executeQuery() method
Handle exceptions using try-catch blocks
JSON is a lightweight data interchange format used to store and transmit data between a server and a web application.
JSON stands for JavaScript Object Notation.
It is easy for humans to read and write, and easy for machines to parse and generate.
JSON is language-independent and can be used with any programming language.
Example: {"name": "John", "age": 30}
Example: [{"name": "Alice", "age": 25}, {"name": "Bob", "age": 35}
Garbage collection in Java is the process of automatically managing memory by deallocating objects that are no longer needed.
Garbage collection helps in preventing memory leaks by reclaiming memory used by objects that are no longer referenced.
Java uses a garbage collector to automatically manage memory, unlike languages like C++ where memory management is manual.
Garbage collection in Java can be triggered by calling S...
Round duration - 30 minutes
Round difficulty - Easy
I wouldn't say it went great but it was fine. I did not think I would clear it as for most of the questions the interviewer seemed disappointed and wanted more out of me.
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.
Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
Use binary search to find the partition point in both arrays
Calculate the median based on the partition point and array sizes
Adjust the partition points based on the median value
Repeat until the partition points are at the median
Handle edge cases such as empty arrays and uneven array sizes
Anagram of strings in O(1) space complexity
Use a fixed size array of integers to store the frequency of characters in the first string
Iterate through the second string and decrement the frequency of each character in the array
If all the frequencies are zero, then the strings are anagrams
Return true or false accordingly
Level order traversal of a tree using Queue
Create a queue and add the root node to it
While the queue is not empty, remove the front node and print its value
Add the left and right child nodes of the removed node to the queue
Repeat until the queue is empty
Reverse level order traversal of a tree using Queue
Create a queue and push the root node into it
While the queue is not empty, pop the front node and push its children into the queue
Add the popped node to a stack
Once the queue is empty, pop elements from the stack and print them
BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.
BFS uses a queue while DFS uses a stack or recursion.
BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.
BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.
BFS can be used to find connected components while DFS
Find product of each element of an array except that element in O(N) time complexity without using / operation
Use prefix and suffix products
Multiply prefix and suffix products for each element to get the final product
Handle edge cases where array has 0 or 1 element separately
Recursively delete a linked list
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null, return
Recursively call the function with the next node as input
Delete the current node
Recursively delete a linked list from the end.
Start from the head and recursively traverse to the end of the list.
Delete the last node and set the second last node's next pointer to null.
Repeat until the entire list is deleted.
Use a recursive function to implement the deletion process.
Recursively delete a tree by deleting all its child nodes and then the parent node.
Start from the leaf nodes and delete them first.
Then move up to the parent nodes and delete them.
Repeat until the root node is deleted.
Use post-order traversal to ensure child nodes are deleted before parent nodes.
Recursively delete elements from the end of an array.
Create a recursive function that removes the last element of the array.
Call the function recursively until the desired number of elements are removed.
Handle edge cases such as empty arrays and removing more elements than the array contains.
Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.
Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.
Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).
Floyd Warshall can handle negative edge weights while Djikstra cannot.
Floyd Warshall can detect negative cycles while Dj
There is no known algorithm to find shortest path in 2-D space in O(log N) time.
The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).
Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).
If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).
Design a system for putting newspapers using classes and functions
Create a Newspaper class with attributes like title, date, and content
Create a Publisher class with methods to publish and distribute newspapers
Create a Subscriber class with methods to subscribe and receive newspapers
Use inheritance to create different types of newspapers like daily, weekly, etc.
Implement a database to store newspaper information and ha
I believe practical experience is more valuable than higher studies.
I have gained valuable experience through internships and projects.
I prefer hands-on learning and problem-solving over theoretical knowledge.
I am constantly learning and improving my skills through online courses and workshops.
based on 2 interviews
Interview experience
Media Analyst
53
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Associate
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Research Analyst
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Assistant
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Meltwater
PR Newswire
Vocus
Onclusive