Castle of Coderz
Mitsogo Question: This mitsogo question is asked in the mitsogo 2nd round interview. To reduce the number to zero by using certain conditions. Conditions: Check whether the given number is prime or not. If the number is prime then decrement the number by 1. Otherwise, find the greatest prime number(GPN) which replaces the number. Then […]
Given an array a[] of n numbers and another number num, check for a pair whether or not there exist two elements in a[] whose sum is exactly num. Logic: Get the array elements and num value from the user. Arrange the elements in ascending order. Initialize l as 0 and r as arr_size-1. Then […]
Given a digital clock, the task is to find how many times the clock shows identical time. A specific time is said to be identical if every digit in the hours and minutes is the same i.e. the time is of type T: T, T: TT, TT: T, TT: TT. Logic: Get the hours and […]
Mandragora Program The evil forest is guarded by vicious Mandragora. Garnet and her pet must make a journey through. She starts with a health point (s) and 0 experience points. As she encounters each mandragoras, her choices are: Garnet’s pet eats mandragora i. This increments s by 1 and defeats mandragora. Garnet’s pet battles mandragora i. This increases […]
Question: Write a program to delete a specific node from the singly linked list. Logic: Get all nodes from the user. Then get the deleting element also from the user. Call the delete() function to remove the node. Search for the previous node and also next of deleting a node. If the deleting element is […]
Question: Microsoft: Print a sequence of numbers starting with N, without using loop, in which A[i+1] = A[i] – 5, if A[i]>0, else A[i+1]=A[i] + 5 repeat it until A[i]=N. Input: The first line contains an integer T, number of test cases. Then following T lines contains an integer N. Output: For each test case, print the pattern in newline with […]
This program can implement a bubble sort algorithm using recursion. Logic: Get the array elements from the user. Then pass a[] and length of the array to bub-sort() function. And check the current element with neighboring element. When the current element is greater then swap the elements. After reaching n-1th the element greater element is […]
This program can sort the elements using selection sort elements in python language. Logic: Select the smallest element in the list. When the element is found, it is swapped with the first element in the list. Then the second smallest element in the list is then searched. When the element is found, it is swapped with […]
Question: Write a program to check the number is mono-digit or not. Conditions: The programmer is allowed to add and subtract the consecutive digits (starting from left). And you are allowed to do only one operation on a digit. You cannot perform any operation on a resultant digit of the previous operation. Your code should […]
Question: It’s about anagram. Input was the array of strings and a word was given to find whether it has anagram in the given array. Logic: Get the string array to check and also a word to check. Find the length of string array b[]. Then generate all combinations of the string using the find combination […]
