I liked the way Grokking the coding interview organized problems into learnable patterns. However, the course is expensive and the majority of the time the problems are copy-pasted from leetcode. As the explanations on leetcode are usually just as good, the course really boils down to being a glorified curated list of leetcode problems.
So below I made a list of leetcode problems that are as close to grokking problems as possible.
| WITH cte as | |
| ( | |
| select *, | |
| ROW_NUMBER() OVER(PARTITION BY CITY ORDER BY CITY)/4 + 1 RN | |
| FROM EmpDetails | |
| ) | |
| SELECT c.city, | |
| STRING_AGG(c.empname, ',') WITHIN GROUP (ORDER BY c.empname), | |
| CONCAT('Team ', ROW_NUMBER() OVER (ORDER BY c.city)) TeamId | |
| FROM CTE c |
| #region problem asked in vm ware : | |
| public class TicTacToe | |
| { | |
| public (bool, List<(int, int)>) CheckWinner(int[][] b) | |
| { | |
| List<List<(int, int)>> winCombos = GetWinningOrdinates(); | |
| foreach (var wc in winCombos) | |
| { |
| public string Getpath(string filename) => Path.GetRelativePath(Directory.GetCurrentDirectory(), $"Data\\Logs\\{filename}") | |
| public void Read(string file) | |
| { | |
| string line; | |
| using (var reader = new StreamReader(file)) | |
| { | |
| line = reader.ReadLine(); | |
| while (line != null) | |
| { |
| public class SortAlgorithm | |
| { | |
| /* | |
| * Below for loop is alog for build heap | |
| * FOR (N/2-1) TO 0 <= Range of internal nodes | |
| * HEAPIFIY(arr, i) | |
| */ | |
| public void BuildMaxHeap(int[] arr) | |
| { |