Given N number of chocolates, where each chocolate has a different price/value, and M number of students, distribute M chocolates to M students such that the difference between the maximum and minimum price/value of chocolates given to students is minimum. Each student gets only one chocolate.

Given a matrix or a binary tree, traverse its elements in a diagonal order.

Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

Given an array of meeting time intervals intervals where intervals[i] = [start_i, end_i], return the minimum number of conference rooms required.

Given a pattern and a string s, find if s follows the same pattern. Here 'follows' means a full match, such that there is a bijection between a letter in pattern and a non-empty word in s.

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. The solution also requires discussion of its time complexity.

Explain and write logic for traversing a 2D array without using recursion. This usually implies an iterative approach like row-major or column-major order.

Explain and write logic to determine if a given singly linked list contains a cycle (is circular).

Compare Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms. Discuss their implementation details, including approaches with and without recursion, and their respective use cases and complexities.

Write a program to find the second largest element in a given array.

You are given an array prices where prices[i] is the price of a given stock on the i^th day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

Write a program to find the union of two sorted arrays.

Find the sum of all elements in a given array.

Write a program to check if a given string is a palindrome.

Implement a program to solve an N x N Sudoku puzzle. The program will be provided with the size N and all necessary initial values for the grid.

Given an integer list input and an integer N, find N elements in the list that make the maximum sum, with the following constraints:

• If you consider an even element in the sum (other than 2), you should include the immediate next element in the sum.
• If you consider a prime number (other than 1), you should skip the next element.
• You should print the combination that makes the maximum sum while maintaining insertion order.

Implement a console application with an Admin dashboard and a Tax Payer dashboard. Functionalities required include: Admin (register new user/admin, create/update tax slabs), Tax Payer (check tax calculation for user), Main Menu. All details (credentials, tax slabs) must be stored in non-volatile storage to persist between program runs. The application should handle various invalid inputs robustly. Part 1 involved implementing the Admin dashboard, Tax Payer dashboard, and tax slab storage.

Given an integer numRows, return the first numRows of Pascal's triangle.

Compress the given String.
Input = aabbbcdddd
output = a2b3cd4

Given a matrix of NM order. Find the shortest distance from a source cell to a destination cell, traversing through limited cells only. Also you can move only up, down, left and right. If found output the distance else -1.

Find the missing number in an array. Difficulty - Medium, because there was some relation between numbers of array.

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

Develop an asset management system for system administrator team of an organization. The system administrator team will purchase software licenses and install the software in their employee devices. The software will be purchased from a vendor, licensed per device installed and it will have a license expiry date. The organization provides the option for employees to hold multiple devices.

The developed system should be able to generate the below reports for a given date range:

• No.of installations of a particular software
• No.of software installed in a device
• No.of software installed for an employee
• Amount spent for a software
• Amount spent for an employee
• Amount spent on a vendor
• No.of installations of software from a vendor
• Devices that have an expired software

Given an integer numRows, return the first numRows of Pascal's triangle.

Input = aabbbcdddd output = a2b3cd4

Given a matrix of NM order. Find the shortest distance from a source cell to a destination cell, traversing through limited cells only. Also you can move only up, down, left and right. If found output the distance else -1.

Find the missing number in an array. Difficulty - Medium, because there was some relation between numbers of array.

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

Develop an asset management system for a system administrator team of an organization. The system administrator team will purchase software licenses and install the software in their employee devices. The software will be purchased from a vendor, licensed per device installed and it will have a license expiry date. The organization provides the option for employees to hold multiple devices.

The developed system should be able to generate the below reports for a given date range:

• No.of installations of a particular software
• No.of software installed in a device
• No.of software installed for an employee
• Amount spent for a software
• Amount spent for an employee
• Amount spent on a vendor
• No.of installations of software from a vendor
• Devices that have an expired software

You are tasked with designing a Snake game for a device with a screen size specified by the user (height x width). Here are the specifics: The snake starts at the top left corner (0, 0) with a length of 1 unit. You are given an array called food where food[i] = (ri, ci) represents the row and column position of a piece of food. The snake eats the food to grow and increase the score by 1. Food pieces appear sequentially on the screen, meaning the next piece of food will only appear after the current piece has been eaten. It is guaranteed that food will not appear on a block currently occupied by the snake. The game ends if the snake goes out of bounds (hits a wall) or if the snake's head collides with any part of its body. You need to implement the Snake Game based on these rules. Additional Details: Time to complete: 3 hours.

Design an M x N matrix and fill the matrix using the Fibonacci sequence in spiral order.

INPUT:
M=3, N=4
OUTPUT:
0 1 1 2
34 55 89 3
21 13 8 5

Different Hidden Test cases were given and tested.

Find if the given 2 Strings are Anagram of each other

1) INPUT:
tests
esstt
OUTPUT:
true
2)INPUT:
skyblue
kysllueb
OUTPUT:
false

You are given a postive integer N and a 1-indexed Array intercity.
There are N number of cities from 1 to N having Bus Terminus in each cities.
You have intercity bus terminus in the cities which are in the array intercity.

Find the Maximum distance a person has to travel to other city without intercity terminus.

Input:
N=5
intercity={1,5}
Output:
2

Explanation:
The nearest intercity distance from City 1 is intercity 1. So distance is 0
The nearest intercity distance from City 2 is intercity 1. So distance is 1
The nearest intercity distance from City 3 is intercity 1 or intercity 5. So distance is 2
The nearest intercity distance from City 4 is intercity 5. So distance is 1
The nearest intercity distance from City 5 is intercity 5. So distance is 0.
Among these 5 values 2 holds the maximum distance. Hence 2 is output

Map the Leadership according to Hierarchy
Indirect reports should come under hierarchy
(eg: If B is reporting to A and C is reporting to B then C is indirectly reporting to A)
1) Input:
A->A
B->A
C->B
D->B
E->D
F->E
OUTPUT:
A->BCDEF
B->CDEF
C->
D->EF
E->F
F->
2) INPUT:
A->B
B->C
C->D
D->E
E->F
OUTPUT:
A->
B->A
C->BA
D->CBA
E->DCBA
F->EDCBA

Find the index of the Largest sub array which has equal amount of 0's and 1's and if there is no such array return -1
Input format: The size of input array,array elements
1)Input:
6
0 1 1 0 1 0
Output:
0 to 5
2)INPUT:
7
0 0 1 0 1 0 1
OUTPUT:
1 to 6
3) INPUT:
3
1 1 1
OUTPUT:
-1

You are a developer at a company that is planning to provide doorstep drop for the employees after work. Write a program for this bearing in the mind following:
1) You can assume the home addresses of the employees as A,B,C,D etc. The office location can be stored as X. You are free to use any distance to each of these locations from office.
2) Assume there are sufficient cabs to service all the employees at any given time.
3) Cabs can be of different types (normal,AC,luxury) and they are allocated based on the designation of the employees. Their charges also vary depending on the type of cab.
4)Your software should be able to generate reports for any time period (total cost per month, total cost per employee, total cost for a given employee in a given period, trips done by a given employee etc...)

Many additional constraints were also given such as locations when we solved the problem.

In an election between two candidates, one got 55% of total valid votes and 20% of the total votes casted were invalid. If total votes were 7500, then what is the number of valid votes that the other person got?

Answer format : "x"

A bag contains 3 white, 4 red and 5 blue balls. Three balls are drawn at random from the bag. The probability that all of them are blue, is

Answer format : "x/y"

Two stations A and B are 150 km apart from each other. One train starts from A at 6 AM at speed of 30 km/hr and travels towards B. Another train starts from station B at 7 AM at speed 20 km/hr towards A. At what time they will meet?

Answer format : "hh:mm am/pm"

Ramesh was 5 times older than Sourav 10 years ago. 5 years from now, Ramesh will be twice older than Sourav. What was the ratio of the age of Ramesh and Sourav 5 years ago?

Answer format : "x:y"

A vessel contains 120 liters mixture of milk and water and water is 25% of milk in the vessel. If 12 liters of water added in the vessel, then find the ratio of water to milk in the resulting mixture?

Answer format : "x:y"

Kapil and Pooja started a business. Kapil invested Rs. 80,000 and after 8 month he invests Rs. 40,000 more. Pooja invested Rs. 1,00,000 and withdraws Rs. 20,000 after 4 months. Pooja is an active partner, so she receives Rs. 2700 per month as salary. If profit share of Kapil after 1 year is Rs. 1,40,000. Then find profit share of Pooja (excluding salary) at the end of the year?

Answer format : "32,50,000"

3 men & 4 women finish 25% of work in 4 days while 8 men & 15 women can finish the whole work in 5 days. In how many days will 13 women finish it?

Answer format : "x"

If ratio of length, breadth and height of a cuboid is 1:2:3 and its area is 88 sq.cm then find the volume of a cube having edge length equal to the breadth of the cuboid.

Answer format : "x"

Speed of a boat is 5 km per hour in still water and the speed of the stream is 3 km per hour. If the boat takes 3 hours to go to a place and come back, the distance of the place is?

Answer format : "x.y"

If an article is sold at a gain of 6% instead of a loss of 6%, the seller gets Rs. 6 more. What is the cost price of the article?

Answer format : "x"

What is the output of this program?

#include <iostream>
using namespace std;
int main()
{
    int i, j, var = 'A';
    for (i = 5; i >= 1; i--) {
        for (j = 0; j < i; j++)
            printf("%c ", (var + j));
        printf("\n");
    }
    return 0;
}

Output of the program

#include <stdio.h>
void f(char**);
int main()
{
    char *argv[] = { "ab", "cd", "ef", "gh", "ij", "kl" };
    f(argv);
    return 0;
}
void f(char **p)
{
    char *t;
    t = (p += sizeof(int))[-1];
    printf("%sn", t);
}

Output of following program?

#include<stdio.h>
void dynamic(int s, ...)
{
    printf("%d ", s);
}
int main()
{
    dynamic(2, 4, 6, 8);
    dynamic(3, 6, 9);
    return 0;
}

Predict the output?

#include <stdio.h>
int main()
{
    void demo();
    void (*fun)();
    fun = demo;
    (*fun)();
    fun();
    return 0;
}
void demo()
{
    printf("program ");
}

What is the output of following program?

# include <stdio.h>
int main()
{  
   char str1[] = "ZohoInterview";
   char str2[] = {'t', 'e', 's', 't', 't', 'e', 's', 't', '1'};
   int n1 = sizeof(str1)/sizeof(str1[0]);
   int n2 = sizeof(str2)/sizeof(str2[0]);
   printf("n1 = %d, n2 = %d", n1, n2);
   return 0;
}

Predict the Output

#include<stdio.h>
int main()
{
    char str[] = "Aptitude";
    printf("%s %s %sn", &str[5], &5[str], str+5);
    printf("%c %c %cn", *(str+6), str[6], 6[str]);
    return 0;
}

Predict the output of the below program:

#include <stdio.h>
#define SIZE(arr) sizeof(arr) / sizeof(*arr);
void fun(int* arr, int n)
{
    int i;
    *arr += *(arr + n - 1) += 10;
}
void printArr(int* arr, int n)
{
    int i;
    for(i = 0; i < n; ++i)
        printf("%d ", arr[i]);
}
int main()
{
    int arr[] = {10, 20, 30};
    int size = SIZE(arr);
    fun(arr, size);
    printArr(arr, size);
    return 0;
}

Print the output

#include<stdio.h>
struct st
{
    int x;
    struct st next;
};
int main()
{
    struct st temp;
    temp.x = 10;
    temp.next = temp;
    printf("%d", temp.next.x);
    return 0;
}

Note: This code defines a struct where one of its members is an instance of the struct itself, leading to an infinitely recursive type definition. This typically results in a compiler error.

Identify the output of the following

union test
{
    int x;
    char arr[8];
    int y;
};
int main()
{
    printf("%d", sizeof(union test));
    return 0;
}

Output of the program

#include <stdio.h>
char *c[] = {"GeksQuiz", "MCQ", "TEST", "QUIZ"};
char **cp[] = {c+3, c+2, c+1, c};
char ***cpp = cp;
int main()
{
    printf("%s ", **++cpp);
    printf("%s ", *--*++cpp+3);
    printf("%s ", *cpp[-2]+3);
    printf("%s ", cpp[-1][-1]+1);
    return 0;
}

Given an array of points, return the maximum number of points that lie on the same straight line.