Cool Plugins Interview Questions and Answers

Q1. About myself , my education and background
Add your answer

Programming related questions and problem solving

Q1. 3 task for 2 trial days
Add your answer

Q1. Dynamic programming question
Add your answer

Q1. Small talk with CEO about my background
Add your answer

Ask you basic input output questions and oops concepts as well as Sql theory and pattern printing or basic of dsa like convert inorder to post order expression and many things like this and aptitude questions as well .

Q1. Family background
Add your answer
Q2. Oops concepts and basic Cs fundamental
Add your answer

Aptitude test and technical questions

Group discussion on generic topics

Q1. Resume based interview questions
Add your answer
Q2. Easy-medium level coding question
Add your answer

60 Minutes coding test was there

Q1. Worst experience ever, never apply for company in this, highly unstable company
Add your answer
Q2. Add two numbers in a linked list, don't apply
Ans. 
Traverse the linked list and add the values of each node without using additional data structures.
• Traverse the linked list while keeping track of the sum in a variable

• Update the sum by adding the value of each node as you traverse the list

• Handle carry over if the sum of two nodes is greater than 9
Answered by AI
Add your answer
Q3. Sort the array by using all sorting algorithms, don't join
Add your answer
Q4. Subset problem find all the subsets
Ans. 
To find all subsets of a given set, use recursion to generate all possible combinations.
• Use recursion to generate all possible combinations of including or excluding each element in the set.

• Start with an empty subset and recursively add each element to create new subsets.

• Each subset can be represented as an array of strings.
Answered by AI
Add your answer
Q5. LRU Cache problem, explain it and implement it
Ans. 
LRU Cache is a data structure that stores a fixed number of items and removes the least recently used item when the cache is full.
• LRU Cache uses a combination of a doubly linked list and a hashmap to efficiently store and retrieve items.

• When an item is accessed, it is moved to the front of the linked list to indicate it is the most recently used item.

• If the cache is full, the least recently used item at the end of the ...read more
Answered by AI
Add your answer

Write a code for HTML DOM

It's normal question easy to cark

It was online test with 3 coding questions and 18 mcqs

Give you 5 problem in maths , string, sql etc