####  Virtual Onsite:\n\n**Round 1.** Task Scheduler ([Course Schedule -II](https://leetcode.com/problems/course-schedule-ii/))\n**Round 2.** There is a connection of nodes in different layers. Each node has some cost and each connection has some cost. All nodes from one layer is connected with every node in the next layer and its prevoius layer, but nodes in same layer are not connected with each other. Find minimum cost to reach from any node in first layer to any node in the last layer.\n**Round 3.** Behavioral round\n**Round 4.** Given a range M to N, count all the number within the range (inclusive) whose count of 1\'s in their binary representation is a fibonacci number.\n```\nEx: Range M=15 N=17\n(15) 01111: 4 -> No\n(16) 10000: 1 -> Yes\n(17) 10001: 2 -> No\nOutput : 1\n```\nFollow-up: consider negative integers in range\nExpected solution using bitwise operation\n\n**Round 5.** Generate string for the nth iteration for following pattern:\n00000\n00001\n.....\n99999\n0000A\n0001A\n.....\n9999Z\n000AA\n.....\nZZZZZ\n\n```\nN = 1: 00000\nN = 2: 00001\n```\nGiven N find the pattern for given string at Nth iteration.\nCould not solve this question, any suggestions how to get this pattern and Nth iteration?

Virtual Onsite:\n\nRound 1. Task Scheduler (Course Schedule -II)\nRound 2. There is a connection of nodes in different layers. Each node has some cost and each 