Leetcode - 3110. Score of a String
Leetcode - 3110. Score of a String You are given a string s. The score of a string is defined as the sum of the absolute difference between the ASCII values of adjacent characters. R...
Leetcode - 3110. Score of a String You are given a string s. The score of a string is defined as the sum of the absolute difference between the ASCII values of adjacent characters. R...
Leetcode - 100. Same Tree Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are str...
Leetcode - 226. Invert Binary Tree Given the root of a binary tree, invert the tree, and return its root. Solution func invertTree(root *TreeNode) *TreeNode { if root == nil{ re...
Domain Name System (DNS) We know about IP addresses that enable every machine to connect with other machines. But as we know humans are more comfortable with names than numbers. It’s easier to rem...
Tree - DSA in Go What are trees? Do you remember what a linked list looked like? Linked lists consisted of several nodes pointing to each other. HEAD -> Node A -> Node B -> Node C -> ...
Leetcode - 33. Search in Rotated Sorted Array There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibl...
Leetcode - 104. Maximum Depth of Binary Tree Given the root of a binary tree, return its maximum depth. A binary tree’s maximum depth is the number of nodes along the longest path fr...
Leetcode Blind-75(+1) Serial Category Name Solve Link 1 Array 1. Two Sum Solve 2 Array 121. Be...
Leetcode - 189. Rotate Array Given an integer array nums, rotate the array to the right by k steps, where k is non-negative. Solution func rotate(nums []int, k int) { ln := len(nums) ...
Google Cloud Learning Resource: Google Cloud Associate Cloud Engineer Course - Pass the Exam! Current Issues of the Company Legacy on-premises hardware is out of warranty. Performance iss...