## Zycus Software Developer Interview 2018

The process comprised of 3 rounds, Pen Paper General Aptitude Test, Coding Round, Technical Interview. Round 1: Aptitude round was pretty easy. Round 2: In the… Read More »

## Sort elements by frequency | Set 4 (Efficient approach using hash)

Print the elements of an array in the decreasing frequency if 2 numbers have same frequency then print the one which came first. Examples: Input… Read More »

## Sorting Array Elements By Frequency | Set 3 (Using STL)

Given an array of integers, sort the array according to frequency of elements. If frequencies of two elements are same, print them in increasing order.… Read More »

## Zycus Interview Experience

ROUND 1: First round was aptitude round, 10 question in 30 minute. Level of difficulty: easy. For each correct answer 2 marks will be awarded… Read More »

## Print all Jumping Numbers smaller than or equal to a given value

A number is called as a Jumping Number if all adjacent digits in it differ by 1. The difference between ‘9’ and ‘0’ is not… Read More »

## Sort elements by frequency | Set 2

Given an array of integers, sort the array according to frequency of elements. For example, if the input array is {2, 3, 2, 4, 5,… Read More »

## Rat in a Maze | Backtracking-2

We have discussed Backtracking and Knight’s tour problem in Set 1. Let us discuss Rat in a Maze as another example problem that can be… Read More »

## Sort elements by frequency | Set 1

Print the elements of an array in the decreasing frequency if 2 numbers have same frequency then print the one which came first. Examples: Input:… Read More »