Company

TravClan Interview Experience for Fresher Trainee Technology, Jan 2021

Posted: 29 Mar 2021
upvote
0
Selected
Interview Rounds
Application Process

Interview Process

Online Coding Interview

Easy
Duration:
90 minutes
Interview-Date:
23 Jan 2021
Problems:
2

This round consist of coding as well as mcq questions

Minimum Cost to Destination

You have been given an N*M matrix where there are 'N' rows and 'M' columns filled with '0s' and '1s'.


View more
Maximum Of All Subarrays Of Size k.

You are given an array consisting of N non-negative integers, and an integer K denoting the length of a subarray, your task is to determine the maximum elements for each subarray of size K.

View more
Next
Round - 2

Preparation

Duration:
5 months
Topics:
Data Structures and Algorithms, Networking, Database Management System, Operating System, Time Complexity, Compiler design, Machine Learning and Artificial intelligence techniques , recursion with backtracking problems and also graph-related algorithms problems
Preparation Tip

Tip 1 : I practiced a lot of problems related to Data structures on the Coding ninjas platform and other coding platforms.
Tip 2 : If you are stuck somewhere in a problem and want to see reference, first, try to understand the algorithm and then move on to code. 
Tip 3 : Just see the algorithm that is how to approach first and don't try to understand from the code right off the bat, code has finer implementation variation that can be done on your own if you are clear with the algorithm. Also for big product companies, prepare enough problems of graphs and trees as these are the most important topics for interviews.

Application Process

Where:
Campus
Eligibility:
No
Resume Tip

Tip 1 : Mention a good level of projects in your resume, and also give a brief detail about each and every project.
Tip 2 : Have at least 1 or 2 good projects from which you know everything involved in the project.

0 upvotes
Have an interview experience that you want to contribute?
PrevPreviousNextNext

Start a Discussion


Want to join the discussion?