CareerCup

Given a string, write an algo and code to print all possible anagrams for given string.
for ex:
Given string: "amz"
Output:
amz
azm
maz
mza
zam
zma

Note: Write Algo and Code

how to print this pattern

input N=4
output :
4444444
4333334
4322234
4321234
4322234
4333334
4444444

input N=3
output :
33333
32223
32123
32223
33333

A typical Change Making problem but a bit twisted. Given a large amount and the denominations given, I need to come up with total number of ways in which the amount can be made using RECURSION. The signature of the function is as follows

int makeChange(int Amount, int[] Denominations)A
Amount-Total Amount
Denominations- The available denominatins.
It returns total number of ways.. make sure this has to be done Using Recursion..

I wanted to know if someone knows how to solve this algorithm in C#!!!
I do not know this programming language that well and need it converted, you do not have to solve the algorithm but it would help if you can!


// You are free to implement the solution in C, C++ or C#.
// You are given a set of numbers stored in your own implementation of queue
// and another set of numbers stored in your own implementation of stack.
// The goal is to calculate the sum of those two sets of values.
// NOTE: You must implement your own Queue and Stack.
//
// Inputs:
// num1 = 123456
// num2 = 654321

// Output:
// result = 777777

#include <stdio.h>
#include <tchar.h>

//yourQueue implementation
//yourStack implementation


// Please use either String or char*
char *yourAdd (yourQueue *num1, yourStack *num2)
{
char *result = 0;
// Your code.
return result;
}

void main(int argc, _TCHAR* argv[])
{
yourQueue *num1; //should only be able to push 0-9. num1->push(10) is invalid
num1->push(1);
num1->push(2);
num1->push(3);
num1->push(4);
num1->push(5);
num1->push(6);

yourStack *num2; //should only be able to push 0-9. num2->push(10) is invalid
num2->push(1);
num2->push(2);
num2->push(3);
num2->push(4);
num2->push(5);
num2->push(6);

char *result = yourAdd(num1, num2);
printf("result: %s\n", result);
}

Write a function to check if two rectangles defined as below, have common area or not. The functions take the top left and
bottom right coordinate as input and return 1 if they have common area, otherwise return 0.


// you can write your additional functions here
int doesRectOverlap(rect ra, rect rb){
/* For your reference
struct rect{
int topx,topy,botx,boty;
};
The above has already been declared please do not redclare */

You have given a number, rearrange the digits of given number and find the next large number.

For example given number is 2576
the next large number is 2657

code is not required approach or algo is enough.

design a data structure to store time series and implement add operation

Printing diagonals of a matrix

How would you structure the game of life (classes, functions etc...)? How would you structure the board if it was played on a sphere?

Find the degree of separation between two people (e.g. LinkedIn's connected feature)

Implement your own sizeof operator using bitwise operation .

algorithm to reverse a singly linked list using one pointer without any additional datastructures

write a program that will analyse the string....

char str[90]="my brother is taller than me@1233334. I always a short man,but smart than him";

1)Remove spaces between words,
2)Find the longest word in the String,
3)Search and count the number of letters"e" in the string 4)Extact the number of integers in string
5)Extract the number of doubles in string
6)Extract the number of words in string
7)Identify the number of sentences in the String.

write a program that will analyse the string....

char str[90]="my brother is taller than me@1233334. I always a short man,but smart than him";

1)Remove spaces between words,
2)Find the longest word in the String,
3)Search and count the number of letters"e" in the string 4)Extact the number of integers in string
5)Extract the number of doubles in string
6)Extract the number of words in string
7)Identify the number of sentences in the String.

Input - List<String> ["star", "rats", "ice", "cie", "arts"]
print all anagrams in buckets:
["star", "rats", "arts"]
["ice", "cie"]

The signature of unimplemented method is given:

public void anagramBuckets(List<String> input);

I was given this question during phone interview.

Fibonacci Numbers: A number is said to be Fibonacci number if it follows the fibonacci property. (Ex: 112, 1123, etc). But additionally, it need not necessarily start with 1, as with the normal fibonacci series. So, in this new definition, 112(1,1,2) is a fibonacci number and so is 121224(12,12,24), and so is 252550(25,25,50). So, given any two numbers as input, print out all the Fibonacci Numbers within that range..

What should be strategy to minimise the impact on external system which is using our table's data for processing?

What is spring Initialization Bean interface?

suppose we have

parent class
add( int , int)

child class
add(double, double )

if we call child_instance.add( int, int), is it correct syntax?

what is generic Eraser in java?

decide collection in java where you can store this range based search?

age range : group id
0-25 : 1
26: 50 : 2
> 51 : 3

best way to store this DS and In search input is age and we should get group id?

when to use serialization vs externalizable interface?

If new object is created by thread then where object's attributes are going to be created? stack or heap?

class Myclass{

String data;
MyObject object;

public void mehtod(){

data = new String("ddd");
object = new MyObject();
int i = 10;
}

Suppose now thread A creates object of this class and calls method() then where data, object and i will be created? heap or stack of thread?

HOW TO RETRIEVE THOSE EMP NAMES WHO ARE BELONG TO THE DEPT HAVING MAXIMUM EMPLOYEE

How reverse key index helps in faster data reading and what is use case for this?
Complexity of B tree index?

Explain Hash and how hashing works?
Another question was on why HashMaps stores same hashcode entry in map as linkedlist, why not it is storing as ArrayList?

Explain Quick sort and how to choose Pivot value in this sorting.

Add the ODD ORDERED elements in a matrix.But the intersecting(middle) element must be added only once.

Ex:

467
932
148
in this matrix 4,7,3,1,8 are odd indexed or odd ordered elements;We have to add them but,
###constraint ###
intersecting(middle) element must be added(used) only once.

Reverse String Ex: "Hello World" into "World Hello"

Write a function to find 5th element from a singly linked List from the end(not from the head) in one pass.