Filter interviews by
I applied via Walk-in and was interviewed in Apr 2024. There were 4 interview rounds.
Nice,,,i like the interview process...
I like the interview process...
Nice i like the interview process...
..
I applied via Naukri.com and was interviewed before Nov 2023. There were 3 interview rounds.
Basic Questions like rev string, Palindrome, Pattern
General Topics like OTT VS Theaters
I was interviewed before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
Two coding questions were given in the first round to be solved in 60 minutes.
Given an array A
containing 'N' integers and an integer m
, rearrange the elements of the array such that the differences between the array elements and m
are sor...
Rearrange array elements based on their differences from a given integer.
Calculate the differences between each element and the given integer.
Sort the elements based on their differences while maintaining the original order for elements with the same difference.
Implement a function to rearrange the array elements as per the given criteria.
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
The task is to find all nodes in a binary tree that are at a distance K from a given node.
Traverse the binary tree to find the given node
From the given node, perform a depth-first search to find all nodes at distance K
Use a list to store the values of the nodes at distance K
Return the list of values in any order
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
N = 4
1
232
34545
4567654
The pat...
Print a triangle pattern of numbers based on a given number 'N'.
Iterate through each row and print the numbers accordingly
Use spaces to center-align the numbers in each row
Increment the numbers in each row as per the pattern
Web server serves static content over HTTP, while application server runs dynamic content and business logic.
Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.
Application server executes business logic, runs dynamic content, and interacts with databases.
Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.
Web server focuses on...
The internet is a global network of interconnected computers that communicate using standardized protocols.
The internet is made up of a vast number of interconnected networks of computers.
Data is transmitted over the internet using protocols such as TCP/IP.
Websites are hosted on servers connected to the internet, and users access them using web browsers.
Internet Service Providers (ISPs) provide access to the internet f...
SQL query to find the nth highest salary
Use the 'SELECT DISTINCT' statement to get unique salary values
Order the salaries in descending order using 'ORDER BY' clause
Use 'LIMIT' and 'OFFSET' to get the nth highest salary
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with behavioral problems.
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 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...
I was interviewed before Jan 2021.
Round duration - 90 minutes
Round difficulty - Easy
The test was of moderate level, the coding question was easy if all the boundary questions were properly considered.
You are given a positive integer n
. Your task is to identify the largest prime factor of this given positive integer.
If there is no prime factor for a given intege...
Identify the largest prime factor of a given positive integer.
Iterate from 2 to sqrt(n) to find prime factors
Check if each factor is prime and update largest prime factor
If no prime factor found, output -1
You are provided with an integer array ARR
of length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T...
Find the smallest positive integer missing from an array of integers.
Iterate through the array and mark positive integers as visited using index as a reference.
After marking, iterate again to find the first unmarked index which represents the missing positive integer.
Handle edge cases like duplicates and negative numbers appropriately.
Example: For input [3, 4, -1, 1], the output should be 2.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer was friendly and he was interested in the implementation first and then the code.
Tips: Be thorough with various implementations and why they are in practice. Try to know the logic behind each implementation.
You are provided with a binary array, i.e., an array containing only 0s and 1s. Your task is to sort this binary array and return it after sorting.
The fir...
Yes, the binary array can be sorted in linear time and constant space using a single traversal.
Use two pointers approach to swap 0s to the left and 1s to the right.
Maintain two pointers, one for 0s and one for 1s, and iterate through the array once.
Example: Input array [1, 0, 1, 0, 1] will be sorted to [0, 0, 1, 1, 1] in a single traversal.
Polymorphism in OOP allows objects of different classes to be treated as objects of a common superclass.
Polymorphism allows for flexibility and reusability in code.
It enables a single interface to be used for different data types.
Examples include method overriding and method overloading.
Operator overloading is the ability to redefine the behavior of operators for user-defined data types.
Allows operators to be used with custom data types
Can define custom behavior for operators like +, -, *, etc.
Helps make code more readable and intuitive
Example: Overloading the + operator for a custom Vector class to add two vectors
Method overloading is having multiple methods in the same class with the same name but different parameters. Method overriding is having a method in a subclass with the same name and parameters as a method in its superclass.
Method overloading involves multiple methods with the same name but different parameters.
Method overriding involves a subclass redefining a method from its superclass with the same name and paramete...
Round duration - 45 minutes
Round difficulty - Easy
The interviewer was looking for a person interested in problem solving. He was looking forward for loud thinking.
Tips: If you don't know any answer, don't lose your cool. It is never necessary to answer all the questions in an interview. Be confident and think loud, so that if you are going the wrong way, the interviewer can assist you.
Round duration - 30 minutes
Round difficulty - Easy
This was the last round and just for formality. The interviewers were looking for a person who would fit in their working culture.
Tips: Be confident and always have a smile on your face. If you are selected for the HR interview, then there is a 90% chance that you would be selected.
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 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.
I was interviewed before Oct 2020.
Round duration - 60 minutes
Round difficulty - Easy
Questions related to Quant and Verbal.
Coding questions checked whether the basics are clear or not.
Given an integer N
, determine whether its binary representation is a palindrome.
The first line contains an integer 'T' representing the number of test cases.
The next 'T'...
Check if the binary representation of a given integer is a palindrome.
Convert the integer to binary representation.
Check if the binary representation is a palindrome by comparing it with its reverse.
Return true if it is a palindrome, false otherwise.
Tip 1 : Prepare for Aptitude Questions well since most companies have aptitude questions in the screening round. So you can proceed with further rounds only when you are well versed with Aptitude
Tip 2 : Be good with at least one programming language. Does not matter which language it is. It can be Java, C, C++, Python or any other language. Most of the coding rounds will be on websites which support multiple programming languages. Java and C are the languages which will be supported everywhere.
Tip 3 : Be prepared with at least the basics of various subjects. For CS students, these subjects could be Operating System, OOPS, Data Structures and Algorithms. Most of the interviewers will check if your basics are clear. Advanced topics are required only for few companies.
Tip 4 : If you don't know the answer to a particular question, then be honest and let me know that you are not aware of that topic instead of making something up. Most of the interviewers have 10+ years of experience and they can easily make out if you know a topic or are just making something up.
Tip 5 : If you have completed an internship, then probably your interview would be about your experience and the projects done at the internship. Be sure to state your experience and your contributions clearly.
Tip 6 : Projects are an important topic for the interview. Before the interviews, revise the projects you had completed or are working on currently. The projects need not be some external projects. These can be academic and final year projects. Make sure you know everything about the project.
Tip 1 : For freshers, always put the Education section before the Experience/Internship section and mention the educational details in reverse chronological order starting with the most recent college/university. No need to mention SSC and HSC. If you are an undergrad student, only mention the undergrad college.
Tip 2 : Always showcase 2-3 projects. The first being the final year project (could be in-progress at the time of the interview) and others can be academic profile.
Tip 3 : Mention your LinkedIn Profile, GitHub profile (For CS students), your blog URL (if you have one) and other portfolio links (relevant to your course of study)
Tip 4 : Skip the objective section. This section is usually not required since you are directly applying for that specific company.
Tip 5 : ALWAYS PROOFREAD YOUR RESUME. Make sure that your resume does not contain any spelling or grammatical errors.
I applied via Job Portal and was interviewed before Oct 2020. There were 4 interview rounds.
based on 2 interviews
Interview experience
Software Developer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Graphic Designer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Language Editor
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Editor
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Automation Test Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Times Internet
Info Edge
Network 18
Jagran Prakashan