April 12, 2021, 9:50 a.m.

📰 "I may not be there yet, but I'm closer than I was yesterday" - José N. Harris

The Devs Like Us Weekly

The Coding Puzzle 🧩

Last Week’s coding puzzle Solution

Remove duplicates from an unsorted linked list.

Example:

If the linked list is 12->11->12->21->41->43

removeDuplicates() should convert the list to 12->11->21->41->43.

This week:

Give an algorithm for reversing a queue Q. Only following standard operations are allowed on queue.

enqueue(x) : Add an item x to rear of queue. dequeue() : Remove an item from front of queue. empty() : Checks if a queue is empty or not.

Examples:

Input : Q = [10, 20, 30, 40, 50, 60, 70, 80, 90, 100] Output : Q = [100, 90, 80, 70, 60, 50, 40, 30, 20, 10]

Input : [1, 2, 3, 4, 5] Output : [5, 4, 3, 2, 1]

 Developer Headlines 📢

❇️ Missing MIT Courses

❇️ Microsoft, Facebook, Uber Plan To Reopen Offices

❇️LinkedIn Gives Staff Week off for Well-being

Developer Events 🎟️

📅 PyCon US 2021(May 12-18) 💵

📅 WebAssembly Summit (April 22nd) 🆓

📅GitLab Commit (Aug 10th - 11th)

Want to recommend someone for our developer spotlight, developer event, or just say hello? Send us an email at yourfriends@devslike.us we want to hear from you!

 Social 💻

YouTube | Podcast | Instagram | Website | Twitter

The Cast on Twitter: Terrence | Clarence | JB

Well, that’s all we have for this week’s issue. A quick reminder to add our Podcast on your favorite platform and subscribe to our YouTube page!

Sincerely,

The DLU Team

You just read issue #10 of The Devs Like Us Weekly. You can also browse the full archives of this newsletter.

Brought to you by Buttondown, the easiest way to start and grow your newsletter.