Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Experiences15.8K+ articles

Interview Experiences14.5K+ articles

Misc7.7K+ articles

Arrays4.2K+ articles

Amazon1.9K+ articles

Sorting1.1K+ articles

Oracle354+ articles

cpp-pair76+ articles

Zycus

9 posts

Zycus Interview Experience for Software Developer

Last Updated: 29 May 2024

Applied to this company via referral. The interview process consisted of the following rounds:Written Round:This round tested the candidate's basic knowledge of aptitude. ...read more

Interview Experiences

Write It Up 2024

Zycus Interview Experience | AI/Machine Learning Engineer

Last Updated: 27 July 2020

Round 1: Assignment.You will get an assignment form HR to solve. For my case it was extraction of data from doc format. The crux of clearing this round lies in labeling th...read more

Interview Experiences

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

Last Updated: 02 June 2023

Print the elements of an array in the decreasing frequency if 2 numbers have the same frequency then print the one which came first.Examples:Input : arr[] = {2, 5, 2, 8, 5...read more

article_image

cpp-unordered_map

Sort elements by frequency using STL

Last Updated: 10 April 2023

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. Examples:Input : ar...read more

Zycus Interview Experience

Last Updated: 23 July 2025

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 and for each wrong one 1 mark...read more

article_image

Interview Experiences

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

Last Updated: 23 July 2025

A number is called a Jumping Number if all adjacent digits differ by 1. The difference between ‘9’ and ‘0’ is not considered 1.All single-digit numbers are considered as J...read more

Sort elements by frequency using Binary Search Tree

Last Updated: 23 July 2025

Given an arrayof integersarr[], sortthe array according to thefrequencyof elements, i.e. elements that have higher frequency comes first. If the frequencies of two element...read more

Last Updated: 18 May 2026

Given a square binary matrix mat[][] representing a maze. Find all possible paths from (0, 0) to (n-1, n-1). A rat starts at the top-left corner (0,0) and needs to reach t...read more

article_image

Sort elements by frequency

Last Updated: 23 July 2025

Given an arrayof integersarr[], sortthe array according to thefrequencyof elements, i.e. elements that have higher frequency comes first. If the frequencies of two element...read more