Graphene Intern Interview Questions and Answers for Freshers

1 hour DSA online test - 4 questions

Q1. DSA - Stack Based Question
Add your answer
Q2. Dynamic Programming based
Add your answer

Q1. Asked from Resume itself
Add your answer
Q2. Past internship experiences
Add your answer

Q1. Trapping Rain Water
Add your answer
Q2. Merge Intervals
Add your answer
Q3. Design a Customer Support Chat Application System
Ans. 
A customer support chat application system for efficient communication and problem-solving.
• Implement live chat functionality for real-time communication

• Include automated responses for common queries

• Integrate ticketing system for tracking and resolving issues

• Provide chat history for reference and continuity

• Ensure data security and privacy measures are in place
Answered by AI
Add your answer

Q1. Tell me about yourself
Ans. 
I am a motivated and enthusiastic individual with a strong passion for learning and gaining practical experience in the field of [internship field].
• I am currently pursuing a degree in [relevant field] at [university name].

• I have completed coursework in [specific subjects] which have provided me with a solid foundation in [relevant skills].

• I have gained practical experience through internships at [company/organization] ...read more
Answered by AI
Add your answer
Q2. Why you want this job.
Ans. 
I want this job because it aligns with my career goals and offers valuable learning opportunities.
• The job aligns with my career goals

• It offers valuable learning opportunities

• I am passionate about the field and want to gain experience
Answered by AI
Add your answer

Easy to medium level of leet code

Q1. 1. Fibonacci series with recursion and without recursion 2. String Palindrome 3. Count all repeated numbers from the array
Ans. 
Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.
• For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.

• For Fibonacci series without recursion, use a loop to calculate the series.

• For string palindrome, compare characters from start and end of the string.

• To count all repeated numbers from the array, u
Answered by AI
View 2 more answers

Q1. 1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the ...read more
Ans. 
Rotate array to find max sum of i*A[i]
• Rotate array to bring maximum element to front

• Calculate sum of i*A[i] for each rotation

• Keep track of maximum sum found
Answered by AI
Add your answer

Q1. 1.Oops concepts 2.Oops code 2.About Java Spring 3. Array stack questions 4.Project discussion
Add your answer

3 question of basic and 3 mcq

Strings,Sort 0 1 2,invert binary tree

Q1. Project Basics and Technical skills
Add your answer
Q2. Your Daily routine
Ans. 
My daily routine involves coding, debugging, attending meetings, and learning new technologies.
• Start the day by checking emails and prioritizing tasks

• Code and debug new features or fix existing issues

• Attend team meetings to discuss progress and roadblocks

• Spend time learning new technologies or improving coding skills

• Collaborate with team members on projects
Answered by AI
Add your answer

Q1. Introduction and general questions
Add your answer

Q1. Advanced Excel questions
Add your answer

2 questions on Hackerearth leetcode medium to hard level

Q1. 2 Technical Interview First round they asked 2 easy questions one of map and other of stack second round they asked LRU Cache and Kadane's algorithm
Add your answer