letscodego

Windows Terminal Notes

Installing

• Chocolatey: choco install microsoft-windows-terminal
• Windows Store: https://www.microsoft.com/en-us/p/windows-terminal/9n0dx20hk701?activetab=pivot:overviewtab

TIP: Pin the Terminal to your Taskbar for quick and easy access

Docs

Great docs here: https://docs.microsoft.com/en-us/windows/terminal/

letscodego

git filter-branch --env-filter '
OLD_EMAIL="old@email"
CORRECT_NAME="newName"
CORRECT_EMAIL="new@email"
if [ "$GIT_COMMITTER_EMAIL" = "$OLD_EMAIL" ]
then
    export GIT_COMMITTER_NAME="$CORRECT_NAME"
    export GIT_COMMITTER_EMAIL="$CORRECT_EMAIL"
fi
if [ "$GIT_AUTHOR_EMAIL" = "$OLD_EMAIL" ]

letscodego

client.ClientCredentials.Windows.ClientCredential.Domain = "WorkstationName";
client.ClientCredentials.Windows.ClientCredential.UserName = "blabla";
client.ClientCredentials.Windows.ClientCredential.Password = "blabla123";

letscodego

public static bool IsAnagram(string s, string t)
{
  if (s.Length != t.Length)
      return false;
  var s_hash = new Hashtable();
  var t_hash = new Hashtable();
  for (var i = 0; i < s.Length; i++)
  {
      s_hash[s.Substring(i, 1)] = 1 + 
                      (int)(s_hash.ContainsKey(s.Substring(i, 1)) ? 

letscodego

public static int[] TwoSum(int[] nums, int target)
{
  if (nums.Length < 2)
      return new int[2];

  var dic = new Dictionary();
  for (var i = 0; i < nums.Length; i++)
  {
      if (dic.ContainsKey(target - nums[i]))
      {

letscodego

public static int[] TopKFrequent(int[] nums, int k)
{
    if (nums.Length == 0 || k == 0)
        return Array.Empty<int>();

    var result = new List<int>();
    Dictionary<int, int> dic = new Dictionary<int, int>();
    foreach (var item in nums)
    {
        if (dic.ContainsKey(item))

letscodego

public static int[] TopKFrequent(int[] nums, int k)
{
    //By bucket sort
    if (nums.Length == 0 || k == 0)
        return Array.Empty();

    var result = new List();
    Dictionary num2count = new Dictionary();
    foreach (var item in nums)
    {

letscodego

public static int LongestConsecutive(int[] nums)
{
    var hashset = new HashSet(nums);
    var longest = 1;
    foreach (var item in nums)
    {
        if (hashset.Contains(item - 1))
            continue;
        if (hashset.Contains(item + 1))
        {