Qtguru's Posts
Nairaland Forum › Qtguru's Profile › Qtguru's Posts
1 2 3 4 5 6 7 8 ... 40 41 42 43 44 45 46 47 48 (of 204 pages)
$9600 rent per year how ? for 2 Bedroom ![]() Sounds doubtful |
sthGood:Learn React, there's more React job and Angular is verbose. Try multiple job boards and slack groups, there are some freelance , contract jobs you can get. It's not easy thought but working on the profile definetely helps. |
Exelica:So it seems we can use Xoom to send to an ACH, meaning I can move my money to Wise, I will add it to a platform and see if it works. I have disabled every permission that will require my location. |
Exelica:Thanks I will be careful not to do too much with it. |
Red Pill Content creator |
BRATISLAVA:Frontend is easier but it's still needed but it will mostly be array operation you'd deal with alot, that and Map. Here's a Discrete Math she explained it well https://www.youtube.com/playlist?list=PLl-gb0E4MII0sGLCJeqDB3y63HZ6lM5LJ |
Paystack:You forgot Grandmaster on CODM also, I have multiple tabs and people working for me. Also I am naturally hardworking and create time for these things, I don't read much and new tech come to me easily, because I research before hand and watched video, it comes with experience. |
BRATISLAVA:You must've encountered these at least once and thus you will know the solution without much stress when you come across them again, reducing your need to study. Yes actually it comes faster to mind, because I've studied however the likes of DP, and Graph is still complex for me, there is some discrete maths I haven't covered up Also are some of the cases of DSA above actually used in your programming life? It could be like some formulas had in mathematics that are never used, though they are studied. Alot of languages have them implemented internally but unless you're backend, so of the DSA you would use on FE would be Array And you keep all these in your head? That is, knowing they exist and how they could be used? No I don't, I usually jot the high level information and reference Algo materials when working on such in real life. |
Don't buy into that myth that engineers know 100% of everything in their head. it's why we keep studying but our studying is not like beginner's level, sometimes some knowledge of Discrete math is required too, but it depends on your role and how far you want to advance. |
BRATISLAVA:It's a lot like alot just Array alone has different Algo tied to it and there are tons of DSA and Algo, so it's something we study to remember and every job interview quizes you on this. Algo is not a done and dusted thing, it's something you have to practice to remember. This is from ChatGPT the curriculum for DSA Introduction to Algorithms and Problem Solving: Basic terminology and concepts Algorithm analysis and complexity Arrays and Strings: Array manipulation and traversal String manipulation and pattern matching Linked Lists: Singly linked lists Doubly linked lists Circular linked lists Stacks and Queues: Implementations and applications Evaluation of expressions Priority queues Recursion and Backtracking: Recursive problem-solving techniques Solving problems using backtracking Sorting and Searching: Bubble sort, insertion sort, selection sort Merge sort, quicksort, heapsort Binary search, linear search Trees: Binary trees Binary search trees (BST) AVL trees, Red-Black trees Tree traversals: inorder, preorder, postorder Graphs: Graph representation (adjacency matrix, adjacency list) Breadth-First Search (BFS) Depth-First Search (DFS) Shortest path algorithms: Dijkstra's, Bellman-Ford Minimum Spanning Tree (Prim's, Kruskal's) Hashing: Hash functions Hash tables Collision resolution strategies Dynamic Programming: Concept of overlapping subproblems and optimal substructure Memoization and tabulation Examples of dynamic programming problems Greedy Algorithms: Greedy choice property Fractional knapsack problem Huffman coding Disjoint Set Union (Union-Find): Data structure and operations Applications in graph problems Advanced Data Structures (optional): Trie, Suffix tree Segment tree, Fenwick tree (Binary Indexed Tree) B-trees, B+ trees Advanced Algorithms (optional): Matrix exponentiation Strongly connected components (Kosaraju's algorithm) Maximum flow (Ford-Fulkerson, Edmonds-Karp) NP-Completeness and Approximation Algorithms (optional): Introduction to complexity classes P vs. NP problem Approximation algorithms |
BRATISLAVA:How many data structures are you familiar with ? it's not a personal attack, I'm trying to see your understanding. |
BRATISLAVA:You know Algorithm and Data Strucutures ? |
BRATISLAVA:The Senior you are, the more you need to know, especially when you want to apply. |
BRATISLAVA:Everybody studies, I'm still studying Algo and DSA at this age at my career and achievement. |
Paystack:Our field requires Linux, I use it as my official OS along with Mac and Windows. I'm on Linux more |
dadrenaline:docs.google.com/presentation/d/1ggZgcWxlS9WivxYT4X-7-tStHNGMvYxZFj3PEfAqlBc/edit?usp=drivesdk |
Wilson300:Me sef am paying people to do my work, stress my brother but reach let me set you in the right path is it coding ? |
1 2 3 4 5 6 7 8 ... 40 41 42 43 44 45 46 47 48 (of 204 pages)
