Snap-on Business Solutions Full Stack Developer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

Timing - 1:00 pm
Zoom video call. Was asked to share screen while coding.
Interviewer was friendly

Q1. 
String Palindrome Verification
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
Input:
The input is a single string without any leading or trailing...read more
Ans. 
Check if a given string is a palindrome considering only alphanumeric characters.
• Remove non-alphanumeric characters from the input string.

• Compare the string with its reverse to check for palindrome.

• Handle edge cases like empty string or single character input.
Answered by AI
Add your answer
Q2. 
Character Counting Challenge
Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...read more
Ans. 
Create a program that counts lowercase alphabets, digits, and white spaces in user input until '$' is encountered.
• Read characters from input stream until '$' is encountered

• Count lowercase alphabets, digits, and white spaces separately

• Print the counts of each character type as three integers separated by spaces
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was taken at 1:00 pm.
This was taken by senior management. 
Was asked to share the screen.

Q1. 
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...read more
Ans. 
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
• Traverse the linked list with two pointers, one moving twice as fast as the other

• When the fast pointer reaches the end, the slow pointer will be at the middle

• If there are even elements, return the one pointed by the slow pointer
Answered by AI
Add your answer
Q2. 
Sort Array of Strings Problem Statement
Given an array of strings ARRSTR[] of size N, and a character C, your task is to sort the ARRSTR[] array according to a new alphabetical order that starts with the ...read more
Ans. 
Sort an array of strings based on a new alphabetical order starting with a given character.
• Iterate through the array of strings and compare each string based on the new alphabetical order starting with the given character.

• Use a custom comparator function to sort the strings according to the new alphabetical order.

• Return the sorted array of strings.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Timing - 5:30 pm
Interviewer was very friendly.