beratcmn

"""
Requirements:
annotated-types==0.6.0
cachetools==5.3.3
certifi==2024.2.2
cffi==1.16.0
charset-normalizer==3.3.2
click==8.1.7
colorama==0.4.6
curl-cffi==0.6.2

adrianhajdin

import React, { useEffect, useState } from 'react'
import { ActivityIndicator, FlatList, Image, TouchableOpacity, View } from 'react-native'
import { Stack, useRouter, useSearchParams } from 'expo-router'
import { Text, SafeAreaView } from 'react-native'
import axios from 'axios'

import { ScreenHeaderBtn, NearbyJobCard } from '../../components'
import { COLORS, icons, SIZES } from '../../constants'
import styles from '../../styles/search'

ivan

[This page is best viewed with https://github.com/ludios/expand-everything, which will load all the comnents below.]

Wherein I try to prioritize reading for the limited amount of time I have this year, and to remind myself to read more than just comments on the Internet. Because of problems of time and shifting interests, I will consider this a success if I read a third of the list. I'll reflect on the reading and deviations from the plan in Jan 2024.

{+} = added after initial planning

• Jamie Brandon - Reflections of a decade of coding
• {+} Aleksandr Hovhannisyan's blog
• the SvelteKit tutorial
• the SvelteKit documentation

luisquintanilla

priyavrat-misra

LeetCode Study Plans

• Programming Skills
• Data Structure
• Algorithm
• Graph Theory
• Dynamic Programming
• Binary Search
• SQL

ali-alaei

class Solution {
  public String alienOrder(String[] words) {
       //For catching Errors
       if(words.length==0) return "";
       //The dependencyMap and countMap data structures 
       Map<Character, Set<Character>> dependencyMap = new HashMap<>();
       Map<Character, Integer> countMap = new HashMap<>();
       //a boolean that determines whether we can build a graph or not
       boolean success = buildGraph(words, dependencyMap, countMap);
       if(!success) return "";

itzmeanjan

#!/usr/bin/python3

from math import ceil
from typing import List, Tuple
from random import randint


def bit_count(num: int) -> int:
    '''
    Same as len(bin(num)[2:])

rouxcaesar

My Thoughts on Bradfield

I've been asked by several people over time about my experience with the classes offered by Bradfield, and thought that I should save some future keystrokes by writing up a short gist for future reference. Hopefully this gist will be useful for others who are considering Bradfield and wondering it is worth it. My intended audience is primarily Launch School students who have completed the Core program and likely also Capstone, but the majority of this gist will be applicable to anyone who is a working/experienced software engineer.

Since late 2019, I've taken 4 short courses from the Bradfield School of Computer Science and in 2021 I enrolled in their Computer Science Intensive (CSI) program¹. Overall, I've found the courses and CSI to be an excellent opportunity to grown my technical skills and broaden my knowledge of CS topics.

The courses I completed were:

• Computer Architecture: The Hardware/Software Interface

zivce

opt.<Runnable>map(value -> () -> System.out.println("Found " + value))
   .orElse(() -> System.out.println("Not present!"))
   .run();

zivce

Optionals.ifPresentOrElse(opt, System.out::println,
      () -> System.out.println("not present"));