Mar 30Gradient for tailwindGradients for Tailwind CSS | Hypercolor A curated collection of beautiful Tailwind CSS gradients using the full range of Tailwind CSS colors. Easily copy and…hypercolor.dev Gradients for Tailwind CSS | Hypercolor A curated collection of beautiful Tailwind CSS gradients using the full range of Tailwind CSS colors. Easily copy and…hypercolor.dev https://codioful.com/ https://uigradients.com/#RelaxingredTailwind Css1 min readTailwind Css1 min read
Jan 2401. Binary Watch(Solution || Leetcode easy || Java)A binary watch has 4 LEDs on the top to represent the hours (0–11), and 6 LEDs on the bottom to represent the minutes (0–59). Each LED represents a zero or one, with the least significant bit on the right. For example, the below binary watch reads "4:51". Given an…Java2 min readJava2 min read
Dec 20, 2022338. Counting Bits(Solution || Leetcode easy || Java)Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i. Example 1: Input: n = 2 Output: [0,1,1] Explanation: 0 --> 0 1 --> 1 2 --> 10…Java1 min readJava1 min read
Dec 20, 2022191. Number of 1 Bits(Solution || Leetcode easy || Java)Write a function that takes an unsigned integer and returns the number of ‘1’ bits it has (also known as the Hamming weight). Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, the input will be given as a signed integer…Java2 min readJava2 min read
Dec 20, 2022190. Reverse Bits(Solution || Leetcode easy || Java)Reverse bits of a given 32 bits unsigned integer. Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, both input and output will be given as a signed integer type. …Java2 min readJava2 min read
Dec 19, 2022136. Single Number(Solution || Leetcode easy || Java)Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space. Example 1: Input: nums = [2,2,1] Output: 1 Example 2: Input: nums = [4,1,2,1,2] Output: 4 …Java1 min readJava1 min read
Dec 13, 2022Factors of a numbersBrute force solution: public class factors{ public static void main(String[] args) { int n = 20; findFactors(n); } static void findFactors(int n){ for(int i = 1; i <= n; i++){ if(n%i == 0){ System.out.print(i + " "); } } } } Time complexity: O(n) Space complexity: O(1) Somewhat optimized: public class factors{…Java1 min readJava1 min read
Dec 12, 2022Newton Raphson Method(a very optimized way to find root)public class NewtonRaphson{ public static void main(String[] args) { System.out.printf("%.3f",sqrt(423749)); } static double sqrt(int n){ double x = n; double root; while(true){ root = (x + n/x)/2; if(Math.abs(root-x) < 1){ break; } x = root; } return root; } }Java1 min readJava1 min read
Dec 12, 2022Finding Square root using Binary SearchToday we are going to see how we can find the square root of any number without using the inbuilt method. public class BinarySearchSQRT{ public static void main(String[] args) { int n = 40…Java1 min readJava1 min read
Dec 8, 2022Pattern Questions ##6QUESTION1: 26. 1 1 1 1 1 1 2 2 2 2 2 3 3 3 3 4 4 4 5 5 6 SOLUTION: public class Patterns { public static void main(String[] args) { Pattern(6); }…Java2 min readJava2 min read
