Software Engineer Jobs
18 genuine, current openings aggregated from public job boards — Remotive, Jobicy, Arbeitnow and RemoteOK. JobStraight never reposts stale listings: each card links straight to the original posting. Before you apply, paste the job into TrueFit to see your honest fit score, tailor your resume in Resume Studio, and rehearse with AceCoach — all free.
Reddit is a community of communities. It’s built on shared interests, passion, and trust, and is home to the most open and authentic conversations on the internet. Every day, Reddi…
Veeam is the Data and AI Trust Company, specializing in helping organizations ensure their data and AI are fully understood, secured, and resilient to enable the acceleration of sa…
You must be located in the Americas, Europe, or Israel to apply. A·Team is a VC-backed, stealth, application-only home on the internet for senior independent software builders to t…
This is a remote role for candidates located in Belo Horizonte, Brazil. About LawnStarter LawnStarter is the nation's leading on-demand marketplace for lawn care and outdoor servic…
This is a remote role for candidates located in Montevideo, Uruguay. About LawnStarter LawnStarter is the nation's leading on-demand marketplace for lawn care and outdoor services,…
This is a remote role for candidates located in São Paulo, Brazil. About LawnStarter LawnStarter is the nation's leading on-demand marketplace for lawn care and outdoor services, w…
This is a remote role for candidates located in Mexico City, Mexico. About LawnStarter LawnStarter is the nation's leading on-demand marketplace for lawn care and outdoor services,…
This is a remote role for candidates located in Campinas, Brazil. About LawnStarter LawnStarter is the nation's leading on-demand marketplace for lawn care and outdoor services, wi…
This is a remote role for candidates located in Florianópolis, Brazil. About LawnStarter LawnStarter is the nation's leading on-demand marketplace for lawn care and outdoor service…
<p style="text-align: center;"><em><span style="font-weight: 400;"><strong>Standort: </strong>Werde Teil unseres Teams – entweder …
At Ceartas, we lead the way in AI-powered brand protection, copyright law, and digital security, safeguarding the integrity of content creators, brands, and enterprises worldwide. …
Mapbox is the leading real-time location platform for a new generation of location-aware businesses. Mapbox is the only platform that equips organizations with the full set of tool…
Mapbox is the leading real-time location platform for a new generation of location-aware businesses. Mapbox is the only platform that equips organizations with the full set of tool…
Mapbox is the leading real-time location platform for a new generation of location-aware businesses. Mapbox is the only platform that equips organizations with the full set of tool…
Most technologies promise the future. We're already building it. At MOTOR Ai , we've spent years doing what others said couldn't be done in Germany: developing Europe's first certi…
Mobileye’s Automotive Software development team is looking for SW developers to work on the cutting-edge of technologies bringing to market Mobileye Autosar self-driving platforms.…
Wir suchen für ein Praktikum eine Entwicklerin oder einen Entwickler mit breitem Interesse und der Bereitschaft, sich in neue Themen einzuarbeiten. Unser Schwerpunkt liegt auf Lara…
<div class="content-intro"><h2>The Company You’ll Join</h2> <p>Carta is the connected platform and AI-native ecosystem for private capital. Built …
Before you apply
Application volume is the defining feature of this market. LinkedIn has been reported to process around 11,000 job applications per minute — roughly a 45% year-on-year rise — and recruiters describe receiving 300–500 applications on a popular role within three days. The practical consequence is that being a plausible candidate is no longer enough; you need to be an obvious one for the specific posting.
Two checks are worth doing before every application. First, the knockouts — work authorisation, years of experience, location and on-site expectations are filterable fields, and failing one ends the application regardless of how strong the rest is. Second, keyword coverage: make sure every skill you genuinely have that the posting names appears in your resume in the posting's own words. That is coverage, not density, and it never means adding skills you don't have. The widely-repeated claim that ATS software auto-rejects 75% of resumes is a myth traceable to a 2012 sales pitch — what actually filters you is those knockout fields plus a recruiter's six-to-eight-second scan, as our ATS guide explains with sources.
Software Engineer interview questions you should be ready for
These are questions that recur in software engineer interviews, with the structure of a strong answer. They're from our own question bank — not scraped from review sites.
Reverse a linked list. Coding
- Clarify singly vs doubly linked, and whether to reverse in place.
- Keep three pointers: prev = null, curr = head, next.
- Loop: save next = curr.next, point curr.next = prev, advance prev = curr, curr = next.
- Return prev as the new head.
- State complexity: O(n) time, O(1) space. Edge cases: empty list, single node.
Watch out: Losing the rest of the list by reassigning curr.next before saving next.
At senior level: Compare with the recursive version and note its O(n) stack cost.
Find whether an array has a pair summing to a target. Coding
- Ask if the array is sorted and whether indices or values are needed.
- Brute force is O(n²) — say it, then improve.
- Walk once with a hash set: for each x, check if (target − x) is already seen.
- If seen, return the pair; else add x to the set.
- O(n) time, O(n) space. If sorted, use two pointers for O(1) space.
Watch out: Forgetting duplicates or the x + x = target case.
At senior level: Discuss the space/time trade-off and which you'd pick given memory limits.
Detect a cycle in a linked list. Coding
- Use Floyd's tortoise and hare: slow moves 1 step, fast moves 2.
- If they ever meet, there's a cycle; if fast hits null, there isn't.
- To find the cycle start, reset slow to head and advance both one step at a time — they meet at the entry.
- O(n) time, O(1) space.
Watch out: Using a hash set and stopping there — it works but costs O(n) space.
At senior level: Explain why the reset step provably lands on the cycle entry.
Explain Big-O and give the complexity of common operations. Conceptual
- Define it as growth rate as input grows, ignoring constants.
- Array index O(1), search O(n), sorted binary search O(log n).
- Hash map average O(1) insert/lookup, worst O(n) on collisions.
- Good sorts are O(n log n); nested loops over the same input are O(n²).
- Mention space complexity too — interviewers often forget to ask.
Watch out: Quoting complexities without being able to justify one.
At senior level: Discuss amortised cost (dynamic array growth) and real-world constant factors.
Find the first non-repeating character in a string. Coding
- Clarify case sensitivity, whitespace and character set.
- Pass one: count each character in a map.
- Pass two: walk the string in order and return the first with count 1.
- Return a sentinel if none. O(n) time, O(k) space for k distinct chars.
Watch out: Iterating the map instead of the string — map order won't give 'first'.
At senior level: Note Unicode/grapheme pitfalls if the input isn't plain ASCII.
Given a binary tree, do a level-order traversal. Coding
- Use a queue seeded with the root (return early if null).
- While the queue isn't empty, record its current length n — that's this level.
- Pop n nodes, push each one's children, collecting values into a level array.
- Append the level array to the result.
- O(n) time, O(w) space where w is the widest level.
Watch out: Not snapshotting the level size, which mixes levels together.
At senior level: Extend to zigzag order or right-side view without rewriting the core.
Predict the full question set for a specific job description →
Listings are aggregated from public feeds and refresh on every site build. JobStraight is not the hiring employer; apply on the linked source page.