Given an array of red, green and blue balls arrange them in groups of all red together, greens together and blue together. Do in a single scan of the array.

You have an array containing only '0's, '1's and '2's. Club same items together in single scan. let's try to understand problem: algorithm: i)  initialize i and j to 0 and  k to n-1 Where n is  number of balls ii) while j <=...

Game of master mind: you have four balls, and four different colors, as a solution. The user tries to guess the solution. If they guess the right color for the right spot, it counts as a 'hit'. If it's the right color, but the wrong spot, it counts as a pseudo-hit.

For example: if the solution is 'RGGB' and the user guesses 'YRGB' they have 2 hits and one pseudo hit. Write a program to, given a solution and a guess, calculate the number of hits and pseudo hits. Solution 1: Algorithm: 1.Take an temp array...

A computer has three registers, A, B and R. It has only three instructions:

A->R : Load R with A B->R : Load R with B A-R->A : Subtract R from A and store the result in A Using these instructions how can you do the follwoing? B->A : Load A with B solution:- A->R       // R ==  A A-R->A...

Design a hash table to store phone #s. Your job is to write a hash function that has a parameter username, and generate a key. Username is unique, length 5 and can be A-Z, 0-9, space. Write a hash function that generate keys without collisions and use minimum memory.

let's try to understand problem: code to generate hash function: #include <stdio.h> #include <math.h> char arr[100]; int i,j=4,total=0; double x; /* this function will generate hashcode */ void hashcode() { for(i=0;i<5;i++) ...

Find the first occurrence of an integer in an array of sorted integers in O(logn).

Given a sorted array, where exists duplicated integers, find the first occurrence of the target integer? code: #include <stdio.h> int arr[100],mid,l,r,len,position,i,target; int binarySearchFirstOccur(); int main() { printf("Enter number...

Explain ((n & (n-1)) == 0)

variant of question:-  find whether a no is power of two ? It's figuring out if n is either 0 or an exact power of two. how ? It works because of binary Bits Magic. but before explaining first i want to define them   n ->  unsigned...

3 Ants and Triangle Puzzle

Three ants are sitting at the three corners of an equilateral triangle. Each ant starts randomly picks a direction and starts to move along the edge of the triangle. What is the probability that none of the ants collide? Now find the same for...

Whats the difference between statically and dynamically typed languages? what is Strong Typing and Weak Typing?

Static vs. dynamic typing Here are some claimed benefits. Static typing 1. Reduced CPU usage since types don’t need to be checked at run-time 2. Reduced memory usage since types don’t need to be stored at run-time 3. Other type-directed...

write a program to find whether the m/c is big endian or little endian

Big endian and little endian are two formats to store multibyte data types into computer's memory. These two formats are also called network byte order and host byte order respectively. let's try to understand problem: code: #include <stdio.h>...

Given n stairs, how many number of ways can you climb if u use either 1 or 2 at a time?

variant of question:- A person can take m steps at a time to reach a particular floor( say in a building). How many different ways can a person reach the nth floor? let's try to understand problem: but we have to make some modification...

Shuffle card algorithm

One common programming question is how to randomly shuffle an array of numbers in-place. variant of question:- How would you write code to shuffle a deck of cards?                        ...