3208. Alternating Groups II | leetcode daily challenge | faang | shashcode

Problem link:
https://leetcode.com/problems/alterna...

Problem Statement:
There is a circle of red and blue tiles. You are given an array of integers colors and an integer k. The color of tile i is represented by colors[i]:

colors[i] == 0 means that tile i is red.
colors[i] == 1 means that tile i is blue.
An alternating group is every k contiguous tiles in the circle with alternating colors (each tile in the group except the first and last one has a different color from its left and right tiles).

Return the number of alternating groups.

Note that since colors represents a circle, the first and the last tiles are considered to be next to each other.

Solution Link:
https://github.com/Tiwarishashwat/Int...

Must Watch:
1. Dijkstra's Algorithm
   • L-23 Dijkstra's Algorithm | Shortest dista...  

2. Prim's Algorithm
   • L-36 | Prim's Algorithm | Minimum Spanning...  

3. Krushkal's Algorithm
   • L-37 | Kruskal's Algorithm | Minimum Spann...  

4. Minimum Swaps for bracket balancing
   • L -62 GFG - Minimum Adjacent Swaps for bra...  

Custom Comparator:
   • Lecture 12 How to Compare Objects | Compar...  

Lambda Expression:
   • L-1 Mind blowing Java 8 feature Lambda Exp...  

Dynamic Programming:
   • Dynamic Programming in one shot | shashcod...  

Graph Playlist:
   • Graph Data Structure Series  

Java Plus DSA Placement Course Playlist:
   • Java and DSA Course Playlist : Online Asse...  

Java Plus DSA Sheet:
https://docs.google.com/spreadsheets/...

Notes:
https://github.com/Tiwarishashwat/Jav...

Telegram Link:
https://shashwattiwari.page.link/tele...

Ultimate Recursion Series Playlist:
   • Recursion and Backtracking Ultimate Series...  

Instagram Handle: (@shashwat_tiwari_st)
https://shashwattiwari.page.link/shas...

Samsung Interview Experience:
   • I cracked Samsung | SRIB Interview Experie...  

Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung