Video Link: Apache Kafka Crash Course | What is Kafka?
- Knowledge
- Node.JS Intermediate level
- Experience with designing distributed systems
- Tools
- Node.js: Download Node.JS
- Docker: Download Docker
- VsCode: Download VSCode
| bun add @tanstack/react-table | |
| bun add next-themes | |
| bunx --bun shadcn@latest add tooltip button accordion alert alert-dialog aspect-ratio avatar badge breadcrumb calendar card carousel chart checkbox collapsible command context-menu table dialog drawer dropdown-menu form hover-card input input-otp label menubar navigation-menu pagination popover progress radio-group resizable scroll-area select separator sheet sidebar skeleton slider slider switch tabs textarea toast toggle toggle-group |
| import { create } from "zustand"; | |
| import { immer } from "zustand/middleware/immer"; | |
| export const useTodoStore = create( | |
| immer((set, get) => ({ | |
| hydrated: false, | |
| setHydrated() { | |
| set({ hydrated: true }); | |
| }, |
| import { create } from "zustand"; | |
| import { immer } from "zustand/middleware/immer"; | |
| import { persist } from "zustand/middleware"; | |
| interface IAuthStore { | |
| hydrated: boolean; | |
| setHydrated(): void; | |
| } | |
| export const useAuthStore = create<IAuthStore>()( |
| def can_travel(N, M, route_A, route_B, X, Y): | |
| # Convert the stops of Route A and B | |
| set_A = set(route_A) | |
| set_B = set(route_B) | |
| # Case 1: travel directly within Route A or Route B | |
| if X in set_A and Y in set_A: | |
| return "Yes" # If both source and destination are in Route A | |
| if X in set_B and Y in set_B: | |
| return "Yes" # If both source and destination are in Route B |
| #include <iostream> | |
| #include <vector> | |
| #include <unordered_set> | |
| using namespace std; | |
| string can_travel(int N, int M, vector<int>& route_A, vector<int>& route_B, int X, int Y) { | |
| // Convert both routes to sets for quick lookup | |
| unordered_set<int> set_A(route_A.begin(), route_A.end()); | |
| unordered_set<int> set_B(route_B.begin(), route_B.end()); |
Video Link: Apache Kafka Crash Course | What is Kafka?
| //Please Solve This | |
| #include <stdio.h> | |
| #include <string.h> | |
| int main() | |
| { | |
| int val = 1000; | |
| char Bin[100]; | |
| int i = 0; |
| #include <stdio.h> | |
| int main() | |
| { | |
| printf("To perform a Matrix Multiplication, We Would need you to Enter the 2 matrices ;"); | |
| // matrix 1 is being created | |
| printf("\n\nFor Matrix 1\n\n"); | |
| printf("How many Rows will be in your matrix : "); |
| #include <stdio.h> | |
| int lenCharArr(char arr[]);// calculates the length of the array | |
| void revCharArr(char arr[]);// swaps the characters in the array | |
| int main(){ | |
| // char x = '*'; | |
| char charArr[] = {"aditya is legend"}; | |
| revCharArr(charArr); |
| #include <stdio.h> | |
| int main(){ | |
| printf("To Create a Matrix, We Would need you to Enter these details ;"); | |
| printf("\n\n"); | |
| printf("How many Rows will be in your matrix : "); | |
| int row; | |
| scanf("%d",&row); |