Mastering Java Course: Set: TreeSet in Java — I have published blog on Set in Java, where I have discussed 3 mostly used types of Set in Java HashSet LinkedHashSet TreeSet In this blog I will be focusing on TreeSet. Set in Java Everyone knows List in java, which is used to store items.vikasss7663.medium.com When it comes to working with ordered collections of elements in Java, TreeSet is a versatile choice. It's…

In this post, we will learn how we can make our own game like Tic Tac Toe using React.js So first of all create a new directory named tic-tac-toe. ( You can use the below command to create using the terminal ) mkdir tic-tac-toe Now create an empty react project …

“The great aim of education is not knowledge but action.” — Herbert Spencer — Successful software engineers are smart, but many have an insecurity that they aren’t smart enough. GitHub Repo 1. Coding Interview University GitHub - jwasham/coding-interview-university: A complete computer science study plan to become a… I originally created this as a short to-do list of study topics for becoming a software engineer, but it grew to the…github.com

Introduction In the ever-evolving realm of coding, one’s style can speak volumes about their craftsmanship. Embracing a consistent and widely-accepted code style not only enhances readability but also reflects a commitment to excellence. In this guide, we’ll embark on a journey to set up Google’s…

Given the root of a binary tree, return the number of nodes where the value of the node is equal to the average of the values in its subtree. Note: The average of n elements is the sum of the n elements divided by n and rounded down to the…

Updates ( Day#11 ): 1. Leetcode Rating 1708 ( Top 11.98 % ) 2. Leetcode Questions Solved 332 Questions ( Rank: 1,75,031 ) We have completed 40 Questions in 11 days. I will try to target HARD Questions that I have already done ( in my Old Account ). I will share the code that I wrote in 2020 and what I wrote today, we will see how am I now ? 3. Python Course ( In Progress ) 4. Kotlin Course ( Not Started )

You are given an integer n, which indicates that there are n courses labeled from 1 to n. You are also given a 2D integer array relations where relations[j] = [prevCoursej, nextCoursej] denotes that course prevCoursej has to be completed before course nextCoursej (prerequisite relationship). …

You have n binary tree nodes numbered from 0 to n - 1 where node i has two children leftChild[i] and rightChild[i], return true if and only if all the given nodes form exactly one valid binary tree. If node i has no left child then leftChild[i] will equal -1…

Don’t talk, show me the code. Yes, I won’t explain this see the diagram and see the code. And yes the approach is not optimized. ( Hint: nCr​+nCr−1​=n+1Cr​ ) Intuition Approach Every time we need to add 1 at the first and last position ( except in one case which is the very first row ) all middle elements we can get from the previous row. Complexity Time complexity: O(n²) Space complexity: O(n) Code