rahulkmr

struct node
{
    int info;
    struct node *left;
    struct node *right;
};

struct node *common_ancestor(struct node *head, struct node* n1,
                             struct node *n2)
{

rahulkmr

class Connection
{
  /* generic code ; private */
  
  /* the interface is public */
  public Connection() {
  }

  public int connectTo() {
  }

rahulkmr

class Rectagle {
}

class Square extends Rectangle {
}

rahulkmr

abstract class Shape {
}

class Rectangle extends Shape {
}

class Square extends Shape {
}

rahulkmr

class Person
{
  public Person() {
  }
 
  public String getName() {
  }

  public int connectToDB() {
  }

rahulkmr

class Driver
{ 
  public static Connection getConnection() {
  }
}

class Person
{
  public Person() {
  }

rahulkmr

class Person 
{
  private String name;
  
  public Person(String name) {
    this.name = name;
  }

  public Person()  {
  }

rahulkmr

int duplicate(int a[], int n) 
{
  int sum = 0, num = n - 1;
  doulbe ideal_sum = (num * (num + 1)) / 2;
  int i;

  for (i = 0; i < n; i++) {
    sum += a[i];
  }

rahulkmr

int missing(int a[], int n) { 
  double num = n + 1;
  double ideal_sum = (num * (num + 1)) / 2;
  int sum = 0;
  int i;

  for (i = 0; i < n; i++) {
    sum += a[i];
  }

rahulkmr

int get_max_range(int a[], int n, int *start, int *end)
{
  int temp_sum  = 0, sum = 0, found = -1;
  int i, j;

  for (i = 0; i < n - 1; i++) {
      temp_sum = a[i]; 
      *start = i;
      for (j = i;j < n; j++) {
          temp_sum = a[j];