Urgent.News

What's breaking now, across thousands of outlets.

Tech

No LeetCode. No club leadership. No internship on my resume. Still got the offer. I wrote about how that happened โ€” and honestly, the path was nowhere near what I expected. What actually got your first interview? ๐Ÿ‘€

How I Got a Job Offer as a Fresher in an AI-Fearing Market โ€” Without LeetCode or Club Leaderships on My Resume Dhruv Jani Dhruv Jani Dhruv Jani Follow Aug 20 How I Got a Job Offer as a Fresher in an AI-Fearing Market โ€” Without LeetCode or Club Leaderships on My Resume # discuss

We haven't written up this one. Dev.to has the full story โ€” the link below goes straight to it.

This story

This is one outlet's version. Read the fullest account.

Read the original at dev.to โ†’

More in Tech

Four products passed their tests. Then I tested them.

Every one of these had a green suite. 147 tests on the portfolio, 77 on the budget proxy, 53 on the conformance checker, 78 on the retrieval system. All passing.

  • Reporter conducted additional testing beyond initial product approvals
  • Scenario overran central guarantee by 303%, revealing critical issues
  • Honest defect-to-false accusation ratio is one to four

Made a Telegram bot that pulls CVE PoCs + tracks blackhat news

There's a neat little CLI tool called CVE2PoC โ€” you give it a CVE, it pulls public PoCs, NVD info, checks if there's an exploit on GitHub or in Metasploit, whether it showed up in bug bounty writeupsโ€ฆ

  • CVE2PoC CLI tool retrieves PoCs, NVD info, and checks GitHub/Metasploit for CVEs.
  • Developer added tag, vulnerability type, year search, HTML/JSON reports to CVE2PoC.
  • Telegram bot with auto-news parser tracks blackhat news from 60+ sources.

From brute force to optimal: leveling up like a Jedi

The Quest Begins (The "Why") I still remember the first time I tried to solve the โ€œmaximum subarray sumโ€ problem on a coding interview.

  • Author recalls first encountering "maximum subarray sum" problem in coding interview
  • Transforms brute-force O(nยณ) solution to optimal O(n) Kadane's algorithm
  • Emphasizes running state mindset for efficient problem-solving in programming

More from Sunday 23 August โ†’