MS Tech Summit’s Post

Day 44/180 ✅💯 #day44 #180daysofcode #hard 2 problem solved . Problem Statement : 1. Transpose of matrix 2. Spiral matrix .

#SurajitNandy #Tree #DSA #Programming #Coding Check for Balanced Tree Link: https://lnkd.in/gxHT2cTF '''class Node:    # Constructor to create a new Node    def __init__(self, data):      self.data = data      self.left = None     self.right = None''' def is_balanced_util(root, res):   if root is None:     return 0        lh = is_balanced_util(root.left, res)   rh = is_balanced_util(root.right, res)       diff = abs(lh - rh)   if diff > 1:     res[0] = False        return 1 max(lh, rh) #Function to check whether a binary tree is balanced or not. class Solution:   def isBalanced(self,root):     #add code here           res = [True]     is_balanced_util(root, res)     return res[0]

Unit/Integration tests using *Fakes Classes* with Hilt/Dagger seemed seductive in theory but once we started to put them into practice, we saw the amount of boilerplate code needed to set up a simple test was crazy. For example, for a simple Feature module, we needed to set 19 fake classes to satisfy all the Dagger Dependencies, which the class that needed testing wasn't even using! So instead of all this nonsense, we went into mocking *without* Hilt/Dagger and we're very happy with how a test class looks now. This tip about Mokk should even improve our setup! 😎

Day 9 of 365 Days of Code 2024 Problem: Spiral Order Matrix I Explanation: This function, iterates over the matrix in a spiral pattern by maintaining four variables (left, right, top, bottom) that denote the current boundaries of the matrix. The boundaries are progressively moved inward after traversing each boundary. The loop terminates when these boundaries overlap, indicating that the spiral traversal is complete. #scalerdiscord #codewithscaler #365daysofcodescaler #365daysofcode 

𝙏𝙚𝙨𝙩𝙞𝙣𝙜 𝙩𝙞𝙥: Instead of creating the object by yourself, you can use @𝙄𝙣𝙟𝙚𝙘𝙩𝙈𝙤𝙘𝙠𝙆𝙨 that will try to inject the mock dependencies.

Have you noticed how everyone has an opinion about LSP - usually the strong one - yet hardly anyone can explain it clearly? It would sound even stranger if I told you that you can automate the verification of the Liskov Substitution Principle. That is how clear it is! Let me change that unfavorable situation by drawing you back to the fundamental principles of OOP. I will teach you how to formalize the definition of a type, either a class or an interface, to define the rules every subtype must satisfy. That will be the Liskov principle at work. With the abstract properties defined, every implementation of an interface and every subclass will always produce objects that are substitutable for objects of their parent type - just as the LSP would define them. https://lnkd.in/d8ymteRM

#bouncebackchallenge Day 3 of #100daystocode Done some advanced patterns like 1.Hollow rhombus 2.Solid rhombus 3.Floyd's triangle and 01 triangle 4.butterfly pattern 5.Diamond etc... Made my basics strong and helped in improving my logical application of basics like loops and all. 👍

from scrappy code to understanding the essence of solid principles.

Day 7 :🌱💡 Ambiguity problem and it's solution with constructor injection 💉 (with type, index attributes ) 👩💻In Spring, ambiguity problems typically arise when there are multiple beans that match a certain dependency injection point, causing confusion for the Spring container when it tries to resolve which bean to inject.🌱🖥📚 #ambiguityproblem #softwaredevelopment

Getting stronger is efficient and effective using The Strength Code Method. I explain how!