i
Owen Media
Filter interviews by
I am a seasoned Senior Developer with over 10 years of experience in full-stack web development.
10+ years of experience in full-stack web development
Proficient in languages such as JavaScript, Python, and Java
Strong understanding of database management systems like MySQL and MongoDB
Experience with front-end frameworks like React and Angular
Led multiple successful projects from conception to completion
The company process involves a structured approach to project development and implementation.
The company follows Agile methodology for project management.
There are regular stand-up meetings to discuss progress and roadblocks.
Code reviews are conducted before merging to the main branch.
Testing is an integral part of the development process.
Documentation is maintained throughout the project lifecycle.
We received the work flow
Rate your
company
🤫 100% anonymous
How was your last interview experience?
I was interviewed before Mar 2024.
Technology based qna
The question is asking about the differences in technology between two versions.
Identify the specific versions being compared
List out the key features or changes in technology between the two versions
Explain how these changes impact the user experience or functionality
I applied via LinkedIn and was interviewed before Aug 2022. There were 2 interview rounds.
SEO friendly content should be relevant, high-quality, and optimized for search engines.
Include relevant keywords naturally throughout the content
Create high-quality, engaging content that provides value to the reader
Optimize meta tags, headings, and images for SEO
Ensure content is easy to read and well-structured
Focus on user experience and mobile-friendliness
Regularly update and refresh content to keep it current and
Content strategy for B2B focuses on industry expertise and thought leadership, while B2C focuses on emotional connection and brand loyalty.
B2B content should focus on providing valuable information, industry insights, and thought leadership to establish credibility and trust.
B2C content should aim to create emotional connections with the audience, focusing on brand storytelling, entertainment, and building brand loyalt...
Owen Media interview questions for popular designations
I applied via Referral and was interviewed before Jan 2022. There were 3 interview rounds.
Top trending discussions
I was interviewed before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
I had one interview for approx. an hour, it includes both Technical and HR round, well mostly technical. Interview starts with tell me something about yourself. Asked in detailed about algorithms/web based projects mentioned in CV, make sure that whatever you have written you have complete knowledge about it. Asked to code few basic algorithms questions. Do mention about small project if you have done related to web development.
If interviewer says if you want to ask any question, its always better to ask one or two question.
A Binary Search Tree (BST) is a data structure where each node has at most two children, with the left child being less than the parent and the right child being greater.
Nodes in a BST are arranged in a hierarchical order where the left subtree of a node contains only nodes with keys less than the node's key, and the right subtree contains only nodes with keys greater than the node's key.
BST allows for efficient search...
Given the root node of a binary search tree and a positive integer, you need to insert a new node with the given value into the BST so that the resulting tree maintains the pr...
Insert a new node with a given value into a binary search tree while maintaining the properties of a BST.
Traverse the BST starting from the root node and compare the value to be inserted with each node's value to determine the correct position for insertion.
Insert the new node as a leaf node in the appropriate position to maintain the BST properties.
Ensure that the resulting tree is a valid binary search tree by follow...
You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.
A BST is a ...
Delete a given node from a Binary Search Tree (BST) and return the inorder traversal of the modified BST.
Traverse the BST to find the node to be deleted.
Handle different cases like node with no children, one child, or two children.
Update the pointers of the parent node and child nodes accordingly.
Perform inorder traversal after deletion to get the modified BST.
Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...
Yes, the cloning of a linked list with random pointer can be accomplished without utilizing extra space.
Use a hashmap to store the mapping between original nodes and their corresponding cloned nodes.
Iterate through the original linked list to create the cloned nodes and update the hashmap.
Iterate through the original linked list again to set the next and random pointers of the cloned nodes using the hashmap.
Time comple...
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 : Must verify your CV from your seniors/batchmates.
Tip 2 : Include all the projects, intern work or hall activities or anything you have done on your own which is related to or interest of company. If you know any back-end/front-end (javascript, php, mysql etc) language do mention. I think the cv shortlist was completely based on previous work and technical skills related to Web Development/Design mentioned in the CV.
Tip 3 : Focus on skills, projects and experiences more.
posted on 6 Dec 2015
Find the second largest prime number and its index from an array of positive integers.
Iterate through the array and check if each number is prime
Store the largest and second largest prime numbers found so far
Also store their indices
Return the second largest prime number and its index
Find the first missing positive number in an array of positive and negative integers.
Sort the array in ascending order
Iterate through the sorted array and find the first positive number that is missing
If no positive number is missing, return the next positive number after the largest positive number in the array
The data structure to program a jigsaw puzzle program would be a graph.
Use a graph data structure to represent the puzzle pieces and their connections.
Each puzzle piece can be represented as a node in the graph.
Edges between nodes represent the connections between puzzle pieces.
To solve the puzzle, use graph traversal algorithms like depth-first search or breadth-first search.
Apply puzzle-solving strategies like findin
Times Internet Limited (TIL) is a digital products company that operates various online platforms and services.
TIL is a subsidiary of Bennett Coleman & Co. Ltd (BCCL), which is India's largest media conglomerate.
TIL operates popular websites and apps like Times of India, Economic Times, Gaana, MX Player, and Cricbuzz.
TIL focuses on digital content, e-commerce, and technology solutions.
TIL has a diverse portfolio of...
I transitioned to software development due to my passion for coding and problem-solving.
I discovered my interest in coding during my civil engineering studies
I took online courses and attended coding bootcamps to learn software development skills
I completed projects and internships in software development to gain practical experience
I enjoy the creativity and problem-solving aspects of software development
The average speed can be calculated by taking the harmonic mean of the two speeds.
To calculate the harmonic mean, divide the sum of the speeds by the reciprocal of the sum of their reciprocals.
In this case, the harmonic mean can be calculated as 2/(1/20 + 1/30) = 24 km/h.
The minimum number of steps to find the defective ball is 2.
Divide the 8 balls into 3 groups of 3, 3, and 2 balls.
Compare the weights of the two groups of 3 balls.
If one group is heavier, divide it into 2 balls and compare their weights.
If the two balls have different weights, the heavier ball is the defective one.
If the two balls have the same weight, the remaining ball in the first group of 3 is the defective one.
Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as the same type.
Polymorphism is achieved through method overriding and method overloading.
Method overriding allows a subclass to provide a specific implementation of a method that is already defined in its superclass.
Method overloading allows multiple methods with the same name but different parameters ...
Operator overloading is the ability to redefine operators for custom classes.
Allows operators to be used with custom classes
Example: '+' operator can be used to concatenate strings
Can improve readability and simplify code
Method overloading is having multiple methods with the same name but different parameters. Method overriding is having a method in a subclass with the same name, return type, and parameters as a method in its superclass.
Method overloading is achieved within the same class.
Method overriding occurs in a subclass that inherits from a superclass.
Method overloading is determined at compile-time based on the number, type, an...
posted on 11 Mar 2015
BST is a binary tree where left child is smaller and right child is greater. Add/delete ops maintain this property.
BST is a data structure used for searching, sorting, and storing data
Add operation: Traverse the tree and find the appropriate position to insert the new node
Delete operation: Find the node to be deleted, replace it with its inorder successor or predecessor, and delete the successor/predecessor node
Time co...
Copy a linked list with random pointers to random nodes in the list.
Create a new node for each node in the original list
Map the original nodes to their corresponding new nodes
Copy the value of the original node to the new node
Copy the random pointer of the original node to the new node using the mapping created earlier
based on 6 interviews
Interview experience
Anonymously discuss salaries, work culture, and many more
Get Ambitionbox App
based on 47 reviews
Rating in categories
Senior SEO Analyst
12
salaries
| ₹0 L/yr - ₹0 L/yr |
SEO Executive
10
salaries
| ₹0 L/yr - ₹0 L/yr |
HR Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior SEO Executive
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Quality Analyst
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Times Internet
Network 18
Times Group
INDIA TODAY GROUP