Gemini Solutions Interview Questions and Answers

String problems in DSA involve manipulation, searching, and pattern matching techniques for efficient data handling.

• 1. String Reversal: Reverse a string using two-pointer technique. Example: 'hello' -> 'olleh'.

• 2. Palindrome Check: Check if a string reads the same forwards and backwards. Example: 'madam' is a palindrome.

• 3. Anagram Detection: Determine if two strings are anagrams. Example: 'listen' and 'silent' a...read more

Understanding a coding question involves analyzing the problem, identifying the requirements, and devising a solution using programming concepts.

• Read the problem statement carefully to understand the input, output, and constraints.

• Identify the key requirements and constraints of the problem.

• Break down the problem into smaller subproblems if necessary.

• Choose appropriate data structures and algorithms to solve the p...read more

Reverse a linked list

• Iterate through the linked list and change the direction of the pointers

• Use three pointers to keep track of the current, previous and next nodes

• Handle the edge cases of empty list and single node list

Turn on one switch for a few minutes, turn it off, then turn on another switch. Enter the room and touch the bulbs to determine which is warm and which is cold.

• Turn on switch 1 and leave it on for a few minutes

• Turn off switch 1 and turn on switch 2

• Enter the room and touch the bulbs

• The bulb that is warm is connected to switch 1, the bulb that is cold is connected to switch 2

Rotate a linked list twice to the right.

• Traverse the linked list to find the length and the last node.

• Connect the last node to the head to form a circular linked list.

• Traverse the linked list again to find the new last node and break the circular link.

• Connect the new last node to the head to complete the rotation.

A linked list is a linear data structure where elements are stored in nodes, each pointing to the next node.

• Consists of nodes, each containing data and a pointer to the next node.

• Types include singly linked lists, doubly linked lists, and circular linked lists.

• Example of singly linked list: 1 -> 2 -> 3 -> NULL.

• Doubly linked list allows traversal in both directions: NULL <- 1 <-> 2 <-> 3 -&g...read more