AceTheInterview
Jobs in Pune | Work better in teams | Socialize with friends | Submit Q&A | Tell a friend
Search site for 

Top 100 Interview Questions & Answers in a convenient and easy to read book!

“I bought this guide a few days ago to prepare for my interview with Oracle. Many of the questions they asked me were from this guide. I found this book absolutely great!”

– Ravi, California

Read more comments...

Interview Questions And Answers RSS Feed

Answers »

  1. Submitted By: Delia — November 17, 2007
    -2 votes
      + -

    Does the string have duplicates? i.e. input string = aabccc

  2. Submitted By: PerpetualManiac — December 10, 2007
    +2 votes
      + -

    answerset will contain all the answers.

    function createSubset(List set, List answerset)
    foreach( element e in set )
    subset = remove(e, set)
    push(subset, answerset)
    createSubset(subset)

    main:
    input: List set
    List answerset = {}
    createSubset(set, answerset)
    sort(answerset)
    remove-duplicates(answerset)
    print(answerset)

  3. Submitted By: srini — December 19, 2007
    +5 votes
      + -

    /**
    * How do I write a program to print proper subset of given string . Eg :input: abc
    * output:{},{a},{b},{c},{a,b},{a,c},{b,c},{a,b,c}
    */
    public void subset(String input){
    char[] chars = input.toCharArray();
    int i =0;
    int j = 0;
    int lead = 1;
    while(lead

  4. Submitted By: cz — February 20, 2008
    +0 votes
      + -

    let abc = 111
    list 000 to 111
    replace 1 with corresponding character

  5. Submitted By: Jack liu — February 26, 2008
    +5 votes
      + -

    use recursive call
    below is my answer:

    #include “stdafx.h”
    #include
    void getsub(char arr[], char* const ret,int count,int n)
    {
    if(n==1)
    {
    for(int i=0;i

  6. Leave an Answer/Comment

    To prove you're a person (not a spam script), type the security text shown in the picture. Click here to regenerate some new text.
    Click to hear an audio file of the anti-spam word

Our Sponsors
Our Sponsors
Contact Us | FAQ | Sitemap | Terms of Use | Privacy Policy | Tell a Friend

Copyright © 1999-2006 Jeeve Technologies LLC. All rights reserved.