igavrysh

// https://leetcode.com/problems/count-vowel-substrings-of-a-string/
// https://youtu.be/hGH_Z4_jMBI
///
class Solution {
    public int countVowelSubstrings(String word) {
        int n = word.length();
        int[] fq = new int[26];
        int k = 0; int l = 0;
        int res = 0;
        for (int r = 0; r < n; r++) {

igavrysh

/// https://leetcode.com/problems/intervals-between-identical-elements
///
class Solution {
    public long[] getDistances(int[] arr) {
        int n = arr.length;
        HashMap<Integer, ArrayList<Integer>> map = new HashMap<>();
        for (int i=0; i<n; i++) {
            ArrayList<Integer> a = map.get(arr[i]);
            if (a == null) {
                a = new ArrayList<>();

igavrysh

13 Sep 2024

2265. Count Nodes Equal to Average of Subtree
809. Expressive Words
106. Construct Binary Tree from Inorder and Postorder Traversal
386. Lexicographical Numbers

6 Sep 2024

igavrysh

This is todo list for my frame.work setup with sway etc.

Ideas list

• https://www.reddit.com/r/swaywm/comments/c1oz8p/from_gnome_shell_to_sway/
• https://www.reddit.com/r/swaywm/comments/t8k07z/what_apps_are_you_running_on_sway_wayland_native/?rdt=34776

Good sample setup:

• https://github.com/junaruga/framework-laptop-config/blob/main/home/.config/sway/config

Todo

igavrysh

# to control bluetooth 
bluetoothctrl
# and? maybe
blueman

# for application launcher
bemenu

# to view apps
waybar

igavrysh

• 917. Reverse Only Letters
• 746. Min Cost Climbing Stairs
• 486. Predict the Winner
• 1856. Maximum Subarray Min-Product

https://leetcode.com/problems/hand-of-straights/ https://leetcode.com/problems/find-subarray-with-bitwise-and-closest-to-k/ https://leetcode.com/problems/building-boxes/description/

igavrysh

/*
857. Minimum Cost to Hire K Workers
https://leetcode.com/problems/minimum-cost-to-hire-k-workers
Attempt#1
*/

class Solution {
    public double mincostToHireWorkers(int[] quality, int[] wage, int k) {
        return 0.0;
    }

igavrysh

/*
1928. Minimum Cost to Reach Destination in Time
https://leetcode.com/problems/minimum-cost-to-reach-destination-in-time

*/

class Solution {
    public int minCost(int maxTime, int[][] edges, int[] passingFees) {
        int src = 0;
        int n = 0;

igavrysh

/**
1530. Number of Good Leaf Nodes Pairs
Attempt#1
https://leetcode.com/problems/number-of-good-leaf-nodes-pairs/
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}

igavrysh

class Solution {
    private int[] parse(String log) {
        int n = log.length();
        int i = 0;
        int[] res = new int[3];
        char ch = log.charAt(i);
        int curr = 0;
        while (ch != ':') {
            curr = curr * 10 + (ch-'0');
            i++;