Groww Backend Developer Intern Interview Questions and Answers for Freshers

Q1. Can remember it but it was simple question from array
Add your answer
Q2. Multiple two numbers (given in string only can be very big have to do in traditional way) that can be very big so we have to store result in string
Add your answer

Topics:-
Duration-1.5 hours
Kadane's Algorithm, Even Numbers at even index & odd at odd index, print out the second highest node of the tree

Q1. DSA ZigZag tree traversal OS Architecture of RAM Types of RAM Difference between compiler and interpreter What is a scheduler What is multithreading Disadvantages of FCFS and how can we use RoundRobin to ...read more
Ans. 
ZigZag tree traversal is a method to traverse a binary tree in a zigzag pattern.
• In ZigZag tree traversal, we visit the nodes of a binary tree in a zigzag pattern, moving from left to right and then right to left.

• We can use a stack or a queue to implement ZigZag tree traversal.

• The algorithm involves maintaining two stacks or two queues to keep track of the nodes at each level.

• We start with the root node and alternate be...read more
Answered by AI
Add your answer

Arrays, LinkedList basic dsa questions

Q1. Binary Tree 2nd largest node
Ans. 
To find the 2nd largest node in a binary tree, we can perform an in-order traversal and keep track of the two largest nodes.
• Perform an in-order traversal of the binary tree

• Keep track of the two largest nodes encountered

• Return the second largest node when traversal is complete
Answered by AI
Add your answer
Q2. Basic web questions
Add your answer

Easy coding question generally A, B level question of codeforces

Q1. OOPs, DBMS , Computer network and some basics over java
Add your answer

JavaScript questions

Check if a tree is binary or not

Q1. Javascript Basic Questions
Add your answer
Q2. React Medium Questions
Add your answer

Q1. Tailwind CSS Questions
Add your answer
Q2. HR Questions
Add your answer

Write code for advance surrying in js

Implement custom hook for api call

Q1. Basic questions arounf my previous work
Add your answer
Q2. Technical questions around performance and code optimization
Add your answer