i
Molecular
Connections
Filter interviews by
Lazy loading is a technique used to defer the loading of non-critical resources until they are needed.
Lazy loading can improve the performance of a React application by reducing the initial load time.
React.lazy() is a built-in function that allows for lazy loading of components.
Code splitting can be used to split the application into smaller chunks that can be loaded on demand.
Lazy loading can be used for images, ...
Angular is a full-fledged framework while React is a library for building UI components.
Angular is a complete solution for building web applications while React is focused on building UI components.
Angular uses two-way data binding while React uses one-way data flow.
Angular has a steeper learning curve while React is easier to learn.
Angular has a larger file size while React has a smaller file size.
Angular has a b...
Block components take up the full width of their container, while inline components only take up the necessary space.
Block components create a new line and take up the full width of their container
Inline components only take up the necessary space and do not create a new line
Block components are used for larger elements like paragraphs and headings
Inline components are used for smaller elements like links and butt...
React has two types of hook methods: State Hooks and Effect Hooks.
State Hooks manage state in functional components.
Effect Hooks manage side effects in functional components.
useState() is an example of State Hook.
useEffect() is an example of Effect Hook.
Functional components are stateless and use functional programming concepts, while class-based components are stateful and use object-oriented programming concepts.
Functional components are simpler and easier to read and test.
Class-based components have access to lifecycle methods and state.
Functional components are preferred for simple UI components, while class-based components are preferred for complex UI compo...
React is a JavaScript library for building user interfaces.
React allows for building reusable UI components.
It uses a virtual DOM for efficient rendering.
React can be used for both web and mobile app development.
It supports server-side rendering for improved SEO.
React is maintained by Facebook and has a large community of developers.
Higher order function takes a function as an argument or returns a function. Higher order component is a function that takes a component and returns a new component.
Higher order function is a function that operates on other functions, either by taking them as arguments or by returning them.
Higher order component is a function that takes a component and returns a new component with additional functionality.
Higher o...
Redux is a predictable state container for JavaScript apps.
Redux is a state management library for JavaScript applications.
It helps in managing the state of an application in a predictable way.
Redux follows a unidirectional data flow architecture.
It uses actions, reducers, and a store to manage the state of an application.
Redux is commonly used with React to build scalable and maintainable applications.
Semantic structure of HTML refers to using HTML elements to properly structure and organize content for better accessibility and SEO.
Semantic HTML elements provide meaning to the content, making it easier for search engines to understand and index the page.
Examples of semantic elements include <header>, <nav>, <article>, <section>, <aside>, <footer>, <main>, <figure>...
I applied via LinkedIn and was interviewed in Mar 2022. There were 5 interview rounds.
Mini project using react and redux
Question based on react concepts, basics and advanced topics of JavaScript, HTML and CSS
React is a JavaScript library for building user interfaces.
React allows for building reusable UI components.
It uses a virtual DOM for efficient rendering.
React can be used for both web and mobile app development.
It supports server-side rendering for improved SEO.
React is maintained by Facebook and has a large community of developers.
Functional components are stateless and use functional programming concepts, while class-based components are stateful and use object-oriented programming concepts.
Functional components are simpler and easier to read and test.
Class-based components have access to lifecycle methods and state.
Functional components are preferred for simple UI components, while class-based components are preferred for complex UI components...
React has two types of hook methods: State Hooks and Effect Hooks.
State Hooks manage state in functional components.
Effect Hooks manage side effects in functional components.
useState() is an example of State Hook.
useEffect() is an example of Effect Hook.
Redux is a predictable state container for JavaScript apps.
Redux is a state management library for JavaScript applications.
It helps in managing the state of an application in a predictable way.
Redux follows a unidirectional data flow architecture.
It uses actions, reducers, and a store to manage the state of an application.
Redux is commonly used with React to build scalable and maintainable applications.
Higher order function takes a function as an argument or returns a function. Higher order component is a function that takes a component and returns a new component.
Higher order function is a function that operates on other functions, either by taking them as arguments or by returning them.
Higher order component is a function that takes a component and returns a new component with additional functionality.
Higher order ...
Semantic structure of HTML refers to using HTML elements to properly structure and organize content for better accessibility and SEO.
Semantic HTML elements provide meaning to the content, making it easier for search engines to understand and index the page.
Examples of semantic elements include <header>, <nav>, <article>, <section>, <aside>, <footer>, <main>, <figure>, <...
Block components take up the full width of their container, while inline components only take up the necessary space.
Block components create a new line and take up the full width of their container
Inline components only take up the necessary space and do not create a new line
Block components are used for larger elements like paragraphs and headings
Inline components are used for smaller elements like links and buttons
Lazy loading is a technique used to defer the loading of non-critical resources until they are needed.
Lazy loading can improve the performance of a React application by reducing the initial load time.
React.lazy() is a built-in function that allows for lazy loading of components.
Code splitting can be used to split the application into smaller chunks that can be loaded on demand.
Lazy loading can be used for images, video...
Angular is a full-fledged framework while React is a library for building UI components.
Angular is a complete solution for building web applications while React is focused on building UI components.
Angular uses two-way data binding while React uses one-way data flow.
Angular has a steeper learning curve while React is easier to learn.
Angular has a larger file size while React has a smaller file size.
Angular has a built-...
I'm seeking new challenges to grow my skills and contribute to innovative projects in a dynamic environment.
Desire for professional growth: I'm eager to learn new technologies and methodologies that can enhance my skill set.
Seeking a collaborative environment: I thrive in teams that encourage creativity and open communication, which I hope to find in a new role.
Interest in innovative projects: I'm excited about the opp...
I excel in problem-solving and collaboration, but I sometimes struggle with time management under tight deadlines.
Strength: Strong problem-solving skills. Example: Successfully debugged a complex UI issue that improved user experience.
Strength: Excellent collaboration. Example: Worked closely with designers and developers to create a cohesive product.
Weakness: Time management. Example: Occasionally underestimate the ti...
Top trending discussions
One question of recursion. Then pillars of angular. Type script interfaces
Angular is a popular front-end framework for building dynamic web applications.
Angular is developed and maintained by Google.
It uses TypeScript for building applications.
Angular provides features like two-way data binding, dependency injection, and routing.
Components, services, modules, and directives are key building blocks in Angular.
Example: Angular allows for the creation of single-page applications (SPAs) with smo...
I appeared for an interview in Feb 2025, where I was asked the following questions.
Div is a block-level element for layout, while span is an inline element for styling text.
Div is used for grouping larger sections of content, e.g., <div class='container'>...</div>
Span is used for styling small portions of text, e.g., <span class='highlight'>text</span>
Div elements take up the full width available, while span elements only take up as much width as their content.
Div can contain ...
I applied via LinkedIn and was interviewed before May 2021. There was 1 interview round.
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process
Track the time taken to rot all oranges and return -1 if any fresh oranges remain
Handle edge cases like no fresh oranges or all oranges already rotten
Consider using a queue to efficiently process adjacent oranges
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...
Find the maximum path sum between two leaf nodes in a binary tree.
Traverse the tree to find the maximum path sum between two leaf nodes.
Keep track of the maximum sum found so far.
Consider all possible paths between leaf nodes.
Handle cases where the tree has only a single leaf node.
Implement a recursive function to calculate the maximum path sum.
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
If the given list is (1 -> -2 -&g...
Find the N-th node from the end of a Singly Linked List of integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
You are given a binary tree consisting of distinct integers and two nodes, X
and Y
. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other or when one node is the LCA itself.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.
Split the input string by spaces to get individual words
Reverse the list of words
Join the reversed words with a single space in between
Handle leading/trailing spaces by stripping them before and after reversing
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
Sort subjects in descending order
Assign subjects to friends one by one until all subjects are assigned
The maximum workload will be the sum of problems assigned to the friend with the most problems
Return the maximum workload as the minimum time required
Grammar in compiler design defines the syntax and structure of a programming language.
Grammar specifies the rules for forming valid statements in a programming language.
It consists of a set of production rules that define how valid programs can be constructed.
There are different types of grammars such as context-free grammar, regular grammar, etc.
Example: In C programming language, the grammar specifies that a for loop...
A token in compiler design is a basic unit of syntax that the compiler can understand and process.
Tokens are the smallest units of a program that are meaningful to the compiler.
Examples of tokens include keywords, identifiers, operators, and punctuation symbols.
Tokens are generated by the lexical analysis phase of the compiler.
Tokens are used by the parser to build the abstract syntax tree of the program.
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current path sum to the total sum when reaching a leaf node
Use modulo (10^9 + 7) to handle large outputs
A regular language is a language that can be recognized by a finite automaton.
Regular languages can be described by regular expressions.
Regular languages are closed under union, concatenation, and Kleene star operations.
Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.
NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.
NP problems can be verified in polynomial time but not necessarily solved in polynomial time.
NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.
Examples of NP problems include the subset sum problem and the traveling salesm...
Round duration - 30 minutes
Round difficulty - Easy
That was the round for which I’ve been waiting for hours
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.
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 24 Jan 2022
I applied via Campus Placement and was interviewed before Jan 2021. There were 3 interview rounds.
Code to split an array of integers into two subarrays with equal sum.
Iterate through the array and calculate the total sum.
Divide the sum by 2 to get the target sum for each subarray.
Use dynamic programming to find a subset of the array that adds up to the target sum.
Return the two subarrays.
Example: [1, 2, 3, 4, 5, 6] -> [1, 2, 3, 6], [4, 5]
Example: [1, 2, 3, 4, 5] -> [1, 4, 5], [2, 3]
Implementing a binary search tree and its traversal methods.
Start by defining a Node class with left and right child pointers.
Implement insert() method to add nodes to the tree.
Implement inorder(), preorder(), and postorder() traversal methods.
Implement search() method to find a node in the tree.
Implement delete() method to remove a node from the tree.
Consider edge cases like empty tree, duplicate nodes, etc.
I applied via Company Website and was interviewed in Jun 2021. There was 1 interview round.
posted on 27 Apr 2022
I applied via Campus Placement and was interviewed before Apr 2021. There were 2 interview rounds.
posted on 27 Jul 2022
I applied via Campus Placement and was interviewed before Jul 2021. There were 5 interview rounds.
Round 1 was about 60 mins long. Basic Aptitude questions along with Programming MCQ
Round 2 had 2 coding questions with a time limit of 60mins. Intermediate level problem solving
knowledge is neccessary.
Scientific Analyst
419
salaries
| ₹1.9 L/yr - ₹5 L/yr |
Senior Scientific Analyst
201
salaries
| ₹3 L/yr - ₹7.1 L/yr |
Patent Analyst
63
salaries
| ₹1.8 L/yr - ₹4.5 L/yr |
Software Developer
35
salaries
| ₹3.3 L/yr - ₹6.1 L/yr |
Associate Project Lead
31
salaries
| ₹4.6 L/yr - ₹7.5 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant