Written Round: (1 hour) Given a linked list and K, print the last K nodes in reverse order.example: 1->2->3->4->5->6, K = 3 output: 6 5 4 Find out whether the given tree is BST or not. Rotate Given matrix by 90 clockwise. Technical Round: (1 hour) Given an array, for every element in the array, you need […]

## Finding Mean, Median, Mode in Python without libraries

In this article, we will learn how to calculate Mean, Median and Mode with Python without using external libraries. Mean : The mean is the average of all numbers and is sometimes called the arithmetic mean. This code calculates Mean or Average of a list containing numbers: n_num = [1, 2, 3, 4, 5] […]

## TCS NQT 2018 (Recruitment Exam)

I am from “Institute of Engineering and Management, Kolkata”. Round 1: TCS conducted a National Qualifier Test (NQT) as the first round of recruitment process this year. There was no concept of Campus Recruitment had happened this year. They fixed two specific dates for this NQT exam that was 2nd September 2018 and 3rd September 2018. […]

## Ways to write N as sum of two or more positive integers | Set-2

Given a number N, the task is to find the number of ways N can be partitioned, i.e. the number of ways that N can be expressed as a sum of positive integers. Note: N should also be considered itself a way to express it as a sum of positive integers.Examples: Input: N = 5Output: […]

## Find four factors of N with maximum product and sum equal to N | Set-2

#include <bits/stdc++.h> using namespace std; void findfactors(int n) { unordered_map<int, int> mpp; vector<int> v, v1; for (int i = 1; i <= sqrt(n); i++) { if (n % i == 0) { v.push_back(i); if (i != (n / i) && i != 1) v.push_back(n / i); } } […]

## Cohesity internship interview

Round 1:The first round was an online round held on Hackerearth. It had 2 questions of easy-medium level.Easliy solvable with decent coding skills. Round 2:This was a Zoom online interview round lasting for about 45 mins. The interviewer went through my resume and asked me to describe my projects.Tip : Know about each word in […]