Ginger Webs Sales Interview Questions and Answers

Aptitude test

Current affairs

Q1. Puzzle , sql related questions
Add your answer

Aptitude+CS fundamentals questions were asked

4 questions majorly based on trees and linked list

Again 3 ques 1 was based on trees,another in linked list and 3rd on kadanes algorithm

Q1. Left view of tree
Add your answer
Q2. Riddle based question
Add your answer
Q3. Detect a loop in linked list
Ans. 
Use Floyd's Tortoise and Hare algorithm to detect a loop in a linked list.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps.

• If they meet at any point, there is a loop in the linked list.
Answered by AI
Add your answer

Q1. Basic C and C++ mcqs
Add your answer
Q2. Function, pointers , time complexity
Add your answer

All multiple-choice questions on object-oriented programming and pointers.

Questions related to linked lists and trees.

Three questions, all regarding LinkedIn, focusing on lists and trees.

Basic multiple-choice questions on programming languages.

DSA round 1 , 3 questions on arrays, LL, trees

DSA round 2 : 3 questions on stack and queue, trees, dp

Q1. Asked DSA question about trees
Ans. 
Understanding tree data structures is crucial for solving various algorithmic problems efficiently.
• A tree is a hierarchical data structure with nodes connected by edges.

• The top node is called the root, and nodes without children are leaves.

• Common types of trees include binary trees, binary search trees, and AVL trees.

• Example: In a binary tree, each node has at most two children.

• Traversal methods include in-order, pre-o...read more
Answered by AI
Add your answer
Q2. Asked DSA question about linked list
Add your answer

Q1. IT WAS MCQ CODING OUTPUT BASED ROUND IN WHICH TOTAL 45 QUESTION
Add your answer

Q1. IT WAS SUBJECTIVE CODING ROUND IN WHICH 1 OUTPUT BASED AND 3 CODING ROUND
Add your answer

IT WAS 3RD CODING ROUND IN WHICH 3 CODING QUESTIONS AND DURATION 75MIN