atiq-cs

# successful upgrade to 2.3.4

$ sudo apt update && sudo apt install --only-upgrade *zfs* --yes
Hit:1 http://apt.pop-os.org/proprietary noble InRelease
Hit:2 http://apt.pop-os.org/release noble InRelease
Hit:3 http://apt.pop-os.org/staging/linux-6.16 noble InRelease
Hit:4 http://apt.pop-os.org/ubuntu noble InRelease
Hit:5 http://apt.pop-os.org/ubuntu noble-security InRelease
Hit:6 http://apt.pop-os.org/ubuntu noble-updates InRelease
Hit:7 http://apt.pop-os.org/ubuntu noble-backports InRelease

atiq-cs

# from 6.12 to 6.16.3, pop_os 24.04 on kernel 6.12.10 generic
#  to record for build of zfs module

$ sudo apt update && sudo apt upgrade --yes
Hit:1 http://apt.pop-os.org/proprietary noble InRelease
Hit:2 http://apt.pop-os.org/release noble InRelease
Hit:3 http://apt.pop-os.org/staging/linux-6.16 noble InRelease
Hit:4 http://apt.pop-os.org/ubuntu noble InRelease
Hit:5 http://apt.pop-os.org/ubuntu noble-security InRelease
Hit:6 http://apt.pop-os.org/ubuntu noble-updates InRelease

atiq-cs

tar (tar from GNUWin32)
$ & "C:\PFiles_x86\PT\GnuWin32\bin\tar.exe" --version
tar (GNU tar) 1.13

Copyright (C) 1988, 92,93,94,95,96,97,98, 1999 Free Software Foundation, Inc.
This is free software; see the source for copying conditions.  There is NO
warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.

Written by John Gilmore and Jay Fenlason.

atiq-cs

// ref code, https://docs.microsoft.com/en-us/dotnet/api/system.globalization.cultureinfo.displayname
// compiled by https://dotnetfiddle.net/

CULTURE ISO ISO WIN DISPLAYNAME                              ENGLISHNAME
        iv  ivl IVL                                          Invariant Language (Invariant Country)  
af      af  afr AFK af                                       Afrikaans                               
agq     agq agq ZZZ Aghem                                    Aghem                                   
ak      ak  aka ZZZ Akan                                     Akan                                    
am      am  amh AMH am                                       Amharic                                 
ar      ar  ara ARA ar                                       Arabic                                  

atiq-cs

// for leetcode meetup
// O(2^n), O(2^n)
public IList<IList<int>> Subsets(int[] nums, int index = nums.Length) {
  if (index == 0)
    return new List<IList<int>>(new IList<int>[] { new List<int>() });

  var temp = Subsets(nums, index - 1);
  int tempLength = temp.Count;

  for (int i = 0; i < tempLength; i++) {

atiq-cs

// complexity less than n lg n

public class Solution {
  List<List<Node>> vertListPos;    // for positive
  List<List<Node>> vertListNeg;    // for negative
  List<List<Node>> vertList = null;    // pointer

  internal class Node {
    public int val { get; set; }
    public int level { get; set; }

atiq-cs

// O(row*col), O(1), O(row+col) stack space

public class Solution {
  char[][] grid;
  
  public int NumIslands(char[,] grid) {
    int count = 0;
    for (int r=0; r<numRows; r++)
      for (int c=0; c<numCols; c++)
        if (grid[r][c] == '1') {

atiq-cs

// O(N), O(N)
public class Solution {
  public int Rob(int[] nums) {
    var dp = new int[nums.Length];
    
    for (int i=0; i<nums.Length; i++)
      dp[i] = Math.Max((i < 2? 0 : dp[i-2]) + nums[i], i<1? 0 : dp[i-1]);

    return nums.Length == 0 ? 0 : dp[nums.Length-1];
  }

atiq-cs

// O(N) Time , O(lg N) Space
public class Solution {
  IList<int> nodeList = null;
  
  public IList<int> RightSideView(TreeNode root) {
    nodeList = new List<int>();
    FindRight(root);
    return nodeList;
  }
  

atiq-cs

/*
UVA#11557 Reference
Solution Link:
 This is the chinese solution acquired from: http://blog.csdn.net/accelerator_/article/details/38783651
    referred by Yonghui Wu (http://www.cs.fudan.edu.cn/en/?page_id=2269)
Generates 

Complexity:
  Generates Pattern string from the input code  fragment of repository n times:
    P[1...m], P[2...m], P[3...m], P[4...m], ....., P[m..m]