i
Moris Media
Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Sep 2022. There were 2 interview rounds.
Proficient in Java, Python, and JavaScript.
Java
Python
JavaScript
Yes, I have worked with several frameworks and libraries including React, Angular, and Node.js.
Worked with React for building user interfaces
Experience with Angular for front-end development
Utilized Node.js for server-side scripting
I approach problem-solving in software development by breaking down the issue, researching possible solutions, and collaborating with team members.
Identify the problem and gather all relevant information
Break down the problem into smaller, manageable tasks
Research possible solutions and consider different approaches
Collaborate with team members to brainstorm ideas and gather feedback
Implement and test the solution, mak
Yes, I have extensive experience with version control systems like Git.
I have been using Git for version control in all my projects for the past 5 years.
I am proficient in creating branches, merging code, resolving conflicts, and performing code reviews using Git.
I have experience with popular Git hosting services like GitHub, GitLab, and Bitbucket.
Yes, I am familiar with software testing methodologies and tools.
I have experience with both manual and automated testing
I am familiar with Agile testing methodologies such as Scrum and Kanban
I have used tools like Selenium, JUnit, and TestNG for testing
I understand the importance of regression testing and performance testing
Yes, I have experience in both backend and frontend development.
I have worked on backend development using languages like Java, Python, and Node.js to build APIs and handle server-side logic.
I have experience in frontend development using technologies like HTML, CSS, and JavaScript to create user interfaces and interactive web applications.
I have used frameworks like React and Angular for frontend development and frame...
Debugging and troubleshooting in software development involves identifying and fixing errors in code to ensure proper functionality.
Identify the problem by reproducing the issue and understanding the expected behavior.
Use debugging tools like breakpoints, logging, and stack traces to pinpoint the source of the error.
Review the code for logic errors, syntax errors, or incorrect assumptions.
Test potential solutions to th...
Yes, I can provide examples of my code that demonstrate my coding style and best practices.
I follow the SOLID principles to ensure my code is maintainable and scalable.
I use design patterns such as MVC, Singleton, and Factory to organize my code effectively.
I write clean and readable code with meaningful variable names and comments for clarity.
I regularly refactor my code to improve performance and readability.
I utiliz...
Yes, I am comfortable working with databases and SQL.
Proficient in writing complex SQL queries for data retrieval and manipulation
Experience with database design, normalization, and optimization
Familiarity with stored procedures, triggers, and views
Knowledge of indexing and query performance tuning
Examples: SELECT * FROM table WHERE condition; CREATE TABLE table_name (column1 datatype, column2 datatype, ...);
Yes, I have experience working with cloud platforms like AWS and Azure.
Developed and deployed applications on AWS using services like EC2, S3, and RDS
Utilized Azure for building and managing cloud-based solutions
Implemented serverless architecture using AWS Lambda functions
Worked on setting up and configuring cloud infrastructure on both AWS and Azure
Scalability in software architecture refers to the ability of a system to handle increasing amounts of work or its potential to accommodate growth.
Scalability involves designing a system in a way that allows it to easily expand in terms of processing power, storage capacity, or network bandwidth.
Horizontal scalability involves adding more machines to distribute the load, while vertical scalability involves upgrading ex...
Yes, I have experience using project management tools and issue tracking systems.
I have used Jira extensively for project management and issue tracking.
I am familiar with Trello for task management and collaboration.
I have also used Asana for project planning and tracking progress.
Yes, I am familiar with security practices and principles in software development.
I have experience implementing secure coding practices such as input validation, output encoding, and proper error handling.
I am knowledgeable about common security vulnerabilities like SQL injection, cross-site scripting (XSS), and cross-site request forgery (CSRF).
I understand the importance of data encryption, secure authentication mec...
Yes, I have experience working on projects that involved integrating third-party APIs and services.
Integrated payment gateways like PayPal and Stripe for e-commerce applications
Utilized social media APIs such as Facebook and Twitter for user authentication and sharing features
Implemented Google Maps API for location-based services
Refactored code by optimizing database queries to improve performance.
Identified slow database queries impacting performance.
Analyzed query execution plans to identify bottlenecks.
Rewrote queries to use indexes and optimize joins.
Implemented caching mechanisms to reduce database load.
Measured performance improvements using profiling tools.
I handle tight deadlines by prioritizing tasks based on urgency and impact on project goals.
Break down the project into smaller tasks and set realistic deadlines for each
Communicate with team members and stakeholders to ensure everyone is on the same page
Use project management tools like Trello or Jira to track progress and prioritize tasks
Focus on high-impact tasks first to ensure project goals are met
Be flexible and ...
Top trending discussions
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 - 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 am a software engineer with experience in developing web applications and a passion for problem-solving.
Experienced in developing web applications using languages such as Java, Python, and JavaScript
Proficient in using frameworks such as Spring, Django, and React
Skilled in problem-solving and troubleshooting
Strong communication and collaboration skills
Passionate about learning new technologies and keeping up with ind
I have experience in software development and have worked on various projects using different technologies.
Started my career as a software developer at XYZ company
Developed web applications using Java and Spring framework
Worked on a project for a client in the healthcare industry, developing a patient management system
Implemented RESTful APIs using Node.js and Express
Contributed to open source projects on GitHub
Current...
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.
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
I applied via LinkedIn and was interviewed before Sep 2021. There were 4 interview rounds.
Aptitude + Coding Test
Some of the top questions asked at the Moris Media Senior Software Developer interview -
based on 1 interview
Interview experience
Business Development Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Front end Developer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Times Internet
Network 18
Times Group
Hindustan Times