Skip to content

vaibhavhere/Zoho-L2Round

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

19 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Zoho-L2 Round

  • This repository contains all my solutions to the questions that were asked in the L2 Round during my Summer Intern @Zoho
  • The L2 Round had a duration of 3 hours wherein the candidate is asked to solve and explain each approach to the question.
  • I was able to solve all the given 5 problem statements and also had the output verified by the Invigilator.

Questions

  1. Given a set of numbers where each number act as length of an side of triangle. Find the total number of combinaions of triangles that can be formed using the given length.

  2. Given a binary string that contains only 1s,0s. Find the number of flips that are required to transform the string into an alternating binary string.

  3. Find the maximum longest substring that has characters that do not repeat.

  4. Given an array of 0s,1s. A Robot is trying to reach the bottom-left of the array. Robot begins at 0,0. Robot can move down and right, Cannot pass through walls(denoted by 1). Return true/false.

  5. Given a string of times h:mm:ss. Find the minimum time duration between all the strings.
![wid4](https://user-images.githubusercontent.com/82175956/228308427-82c51ae6-471e-4359-b90a-7bae7b559b14.jpg) ![wid1](https://user-images.githubusercontent.com/82175956/228308434-45e570d1-ae73-47cc-bf11-3daecbdb3bd9.jpg) ![wid3](https://user-images.githubusercontent.com/82175956/228308443-0f9ff434-cbb9-4ffc-868a-a69795a8ebad.jpg) ![wid2](https://user-images.githubusercontent.com/82175956/228308444-862fb4d9-7a93-4c5d-b84a-4cb8450ed688.jpg)

About

Solutions to the problems presented during L2 round @zoho

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages