We’re lucky to have high interest from companies interested in an agency who’s sole focus is building software teams so I created this short video to showcase what a typical DevGrabr client looks like. From a biz dev perspective I’m only one dude and can only set X many meeting so I wanted something prospective clients can check out to see if we’re a match, or not. I also contrast our focus/method vs. large big box recruiting agencies to show why DevGrabr is is just a better option for quality/delivery/price & the biggest factor, software domain expertise. #javascript#typescript#java#csharp#react#python#golang#rust#vim#AI#aws#azure#software#softwareengineering#techrecruiting#AllWeDoIsBuildDevTeamsThatShip
What's up y'all? This will degrade her. We are a software specific recruiting agency with really one focus and that's building perm dev teams. It's all we do. And because luckily there's been a high interest in that and I'm one dude from a biz dev perspective, I can only set so many appointments and I am. So I thought what a great opportunity to a quick video to really just showcase what a typical dev grabber client profile looks like in order to facilitate things and see if we could help each other. So let's get into it and we'll start with number one. This is really easy. And honestly, if I had to stop the video right now, I think this would be enough for some tech leaders, alright, regardless of industry, regardless of domain, what kind of software they're building, this is the number one attribute that my clients have. It's that time is their most valuable commodity by far. So most of them look at it from the perspective of. So I'm spending an hour talking to some of them. Not going to hire. That's an hour I could have spent building my product, building a client, things of that nature. OK, So regardless of what any of my clients do #1 Overwhelmingly why they appreciate me. OK, I'd say #2. Really kind of maybe an after effect of #1 alright, so my clients want to be introduced to a few engineers that they'd be excited to make offers to, OK, They don't want the flip side. They don't want 50 people in their e-mail box that qualify for the job. OK, Now if you're trying to build an HTS or you've got a team of people sitting around that can do all that front side screening, OK, They can look at qualifications, criteria, motivations, likability. Building software is intense. It's intimate, OK, I scream for people that you actually want to write code with, then by all means, use general IT recruiters. But if you're looking to just meet a few people that you're like, Oh my gosh, will I don't know who to pick from, then I'm probably a better choice. All right #3 is the biggest differentiator between me and the other guys. Alright? I honestly don't care. How long the Earth's been spinning. I don't care about calendar days flipping. I don't care if you've got 15 years of sequel. All right, when I'm doing my Zoom profile and I talked to every candidate that I submit for 45 minutes to an hour, we're talking about what they built, all right? So if you value an engineers portfolio of work versus just years of experience, that's what you're going to get. When I do my profile, which is a single spaced boom, boom, boom, it's their qualifications, motivations to work there and what they've built. And your tech stack OK hiring managers flip out about this because it's just it's really one of the things that's broken about recruiting OK if. If I had to sum up in one succinct, eloquent sentence, what I do, it's this. I built software engineering teams that stick together and ship. They stick together. They get a velocity, a comfort with each other. They either stay in that job and they kill it or they get promoted. I think probably about 60% of the time my people end up being your future leaders. OK, I'm very proud of that. So if this is your overall goal and all of the other stuff makes sense, man, I'm telling you. Agencies that specialize in it, in my opinion, are specialized in nothing at all. Folks, it's 2024, I don't even know what it means anymore. Alright, IT is like something my dad used to do. OK, so if your code is a revenue stream for you, if you're trying to ship stuff for your customers or bill clients for building them, great stuff, all right, I'm a great option. And overall, this is another thing y'all got to be wary of. Percentage based fees are for suckers. Do you know how easy it is to get someone to accept a salary for more money? OK, you know it's really hard finding a mid level C# guy, girl, person, whatever for 85 K OK, so don't. Pay fees to agencies that aren't earning them just because you're trying to make great offers and in this market, you still need to. OK? So again, if this fits you guys, this fits y'all. Umm, and you value this most, Reach out and will adaptgrabber.com love to see an e-mail from you or we can engage on LinkedIn. All right, thanks a lot.
Weekly Contest #409: 3/4 solved
Problem 1: Design Neigbour Sum Service - https://lnkd.in/enVsqfj7
Given a 2D matrix, implemented 2 functions which returns sum of neighbouring elements (top,left,right,down) and diagonal elements (top left, top right, bottom left, bottom right)
Problem 2: https://lnkd.in/e2WAQrrW
Applied dijkstras algorithm after every query addition and calculated shortest distance and stored it inside the output array and returned it.
Problem 3: Shortest Distance After Road Addition Queries II - https://lnkd.in/etXwWp9W
Spent lot of time optimizing above solution but didn’t work since hidden cases were too big.
At the end realised one fact that, when we have n nodes, then shortest path is sorted set of all these nodes. And when a new edge is added, this new edge is reducing value of the shortest path.
Initially added all nodes in tree set and length of this tree set is shortest path and then when a new edge u -> v is given, removed every nodes between u and v from the tree set and updated length of the updated tree set as shortest path distance inside the output array.
Every time while removing the element between u and v, I used higher(u) method of tree set which gives strictly greater element compared to u in O(logn) time. I kept removing this next greatest element as long as its less than v.
Here in the worst case time complexity would be O(nlogn).
Happy Coding!
#coding#softwareengineering#programming#developer#techjobs#100daysofcode#devcommunity#technology#hiringnow#techrecruiting#engineeringjobs#softwaredeveloper#fullstackdeveloper#datastructures#algorithms#leetcode#techcareer#jobsearching#java#javascript#opentowork
The Rise of No-Code Automation in 2024
In the ever-evolving world of web automation, no-code platforms are rapidly gaining traction. Businesses of all sizes are now leveraging these tools to streamline processes without needing extensive coding knowledge. This trend is particularly beneficial for small to medium-sized enterprises, allowing them to compete with larger companies by automating repetitive tasks and focusing on growth.
But where does this leave traditional developers? The demand for custom web automation is still strong, especially for complex workflows that go beyond the capabilities of no-code tools. As a seasoned Python developer, I’ve seen firsthand how custom solutions can drive significant efficiency and innovation in various industries. The key is finding the right balance between simplicity and customization.
#NoCode#WebAutomation#TechTrends#BusinessEfficiency#AutomationTools
🚀 LeetCode Daily Challenge 29/100 🚀
📊 HARD
🎯 Problems: Set Intersection Size At Least Two
💡 Solutions:
- Set Intersection Size At Least Two
--> What do we understood?
----> The maximum length is 2 * intervals length
----> Also there will be a lot of intersections between the intervals
--> We have to sort intervals array by it's second item means a[1] - b[1]
--> So we can start by adding coverage for first interval, which are higher range - 1 and higher range itself
--> Then we will iterate over intervals array from 1 and:
----> Taking last 2 elements since we know they are correct
----> If first element is out of range but second is in it and equals to higher range of the current interval:
------> We will pop last element from the result and insert current higher range - 1 and then insert back popped element
----> If first element is out of range but second is in it and less than higher range of the current interval:
------> We will just push current higher range
----> If both of last 2 elements in result are less than lower range:
------> We will push higher range - 1 and higher range
🚧 Complexity Analysis:
- Set Intersection Size At Least Two
Time Complexity: O(NlogN), where N - total amount of intervals.
Space Complexity: O(N)
Please share Your own solution and improvements suggestions in the comment section 💕
#LeetCode#DailyChallenge#Medium#LinkedList#Algorithms#SoftwareDevelopment#Developer#Tech#Coding#DataStructures#React#NodeJS#ProblemSolving#CodeChallenge#Recruiters#Connections#SoftwareEngineering#OpenToWork#SoftwareEngineer#Graph#Bfs#Array#Data#OOP#NodeJS#JavaScript#TypeScript#React#Angular#Engineer
Roofing services done the "Wright" way!
1mo#devgrabr CFBR