• 0

Programmers: Your favorite interview questions


Question

I haven't seen one these posts yet on this forum(if there is forgive me : )), but I figured to help out more people looking for programming work I would start a post for employers who are looking to hire new programmers what kind of questions you guys ask. I'm the technical director at a small game studio in LA, and were expanding so I also looking to see what everyone does so I can adjust accordingly.

Some of the basic questions I ask are:

What is global scope/local scope.

What is a template class

What is inheritance/polymorphism/etc.

Than some really basic logic stuff like whats a recursive function, etc etc.

Than I begin to ask a couple questions that are kind of off the wall because one thing I noticed is College graduates from big schools such as UCLA 9/10 can't figure stuff for themselves. Students are so used to stuff getting spoon fed to them, some of which is just nasty. One thing that really irritated me at one of the studios I worked at previously a couple of there senior programmers came to me and said "I don't know how to do xyz, can you help?" This normally is a pretty common thing, except when xyz happens over and over again and its something that easily be found by doing a quick google search.

I ask the interviewee if they can do something that 99% of the programmers out there can't do. They would obviously say I don't know, I would then ask them than to look it up for me on google and write out basic steps on how to get it done. Lets say I ask them how to register a custom Debug Engine in Visual Studio, first google search for "visual studio custom debug engine" which turns up http://msdn.microsof...4(v=vs.80).aspx , with a link to http://msdn.microsof...(v=vs.110).aspx. Even though the information on the latter article is actually wrong if they copied that I would be so happy. I've had guys sit there for 10 minutes struggling, and I feel that's kind of ridiculous. Every programmer in world should know how to use google :/.

Than depending on the level of the job, I would go into some more nitpicker things say in Unreal, Unity, D3D, whatever and if someone didn't know the answer I would ask them to google it and give me an explanation. I had actually had one guy who didn't graduate from a college, straight out of high school and he didn't know something I asked him, and than he immediately asked if he could go on google and look it up. I actually hired him on the spot and he ones of the best programmers I've ever had.

Anyway what kind of stuff do you guys ask?

Recommended Posts

  • 0

I no longer ask technical questions because we aren't allowed to do face to face interviews and over the phone, any one can do fairly well so I base my judgement on the applicants technical inquiries.

  • 0

It's probably worth mentioning why that won't always work... what happens if a = MAX_INT - 2 and b = MAX_INT - 3? The addition of a and b will overflow...

Can you think of another operator you can use?

There's a cute trick with the xor operator but I don't see any value in testing if the candidate knows about it. If he can find it on the spot then that's certainly impressive, but is it really the kind of skills you're looking for? On modern CPUs this is even counter-productive compared to using a temporary variable, so it's a typical example of premature and misguided "optimization". I view this type of question as outdated and as an interviewee it'd raise doubts in my mind about the company.
  • 0

I no longer ask technical questions because we aren't allowed to do face to face interviews and over the phone, any one can do fairly well so I base my judgement on the applicants technical inquiries.

Wow, really? I would struggle to employ anyone I haven't met face to face. Just out of interest, how many of the candidates you employ turn out to be a waste of space?

  • 0

As already mentioned by a few of the people above, FizzBuzz (well, a slight variation on the FizzBuzz question) is probably my favourite. While it doesn't find "good" programmers it does well to quickly weed out the 80-90%+ of applicants applying for programming jobs who can't code at all. At work we always ask it before the proper interview, if the applicant can't do it with and without modulo in a reasonable time we don't even bother with the full interview.

  • 0

if you can't do a modulus program..... and 99.5% don't get it? seriously?!

There's a cute trick with the xor operator

I haven't really used modulus for anything besides rand(), and to be honest I would be tripped up on a modulus question. XOR operators I have used, and do use on a regular basis, but the mechanics behind xor I would only consider asking if I'm hiring for a high level position that has a lot of technical work behind it that would benefit from knowing how xor stuff works(e.g like a video codec). I try to steer clear of nitty gritty stuff like this because people are coming in knowing there competing against a lot of people so they come in scared.

I have been doing programming now for 17 years and professionally for 10, it really wasn't until I went to college and talked to people in the game industry that I was able to land my first gig. I'm entirely self taught(I really just went to college to do the meet and greet stuff), and I remember when I was first out of high school I got a dry interview at Square Enix. The guy asked me what was global scope and local scope; I knew what scope was but never heard that term before. Needless to say I botched up the interview, but now that I actually have to do interviews I try to take that experience into account.

Their are a lot of veterans in the game industry(my field anyway) who are entirely self taught like myself that haven't heard various terms like scope(until someone brings it up) but they know what it is. This is why I try not to be a term nazi and if someone doesn't know something, I give them the chance to look it up. If they see the term and go drr and from there look away from the screen, and tell me exactly what it is I'm just fine with that. But you would be surpised on how many college graduates can't look stuff up, and I know for a fact they probably haven't done some parts of what I need them to do(just becuase a lot of game programming stuff isn't taught in any school), and if they can't figure it out I can't hold someones hand through the work.

While it doesn't find "good" programmers it does well to quickly weed out the 80-90%+ of applicants applying for programming jobs who can't code at all.

Again it finds programmers that paid attention in school, doesn't mean they have good logic, just good retention :p.

"C++/CLI should be thought of as a language of its own (with a new set of keywords, for example), instead of the C++ superset-oriented Managed C++ (MC++) (whose non-standard keywords were styled like __gc or __value)." http://en.wikipedia....iki/C%2B%2B/CLI

C++/CLI has its own ECMA standard distinct from the ISO C++ standard, it is not designed by the same comittee, it has a different syntax, a different compiler, it compiles for a different platform.

CLI I don't think is used enough and have enough practical usage to be taught as its own course. Personally, I wish CLI would just go away, it really clusters up a codebase :/.

if the applicant can't do it with and without modulo in a reasonable time we don't even bother with the full interview.

To each his own, but I personally like the steer away from stuff like that because as I said just above that shows more retention rather than logic, and since a lot of things I need my employess to get done aren't taught in school I really try and group logic testing and ability to research something in one section of the interview. This why I ask someone how to do something I know isn't taught in school, and they can outline and do research on what needs to get done as quickly as possible odds are there pretty logical.

Before that if they know polymorphism, pointers, etc I know they can at least program, so I try not to focus to much on if they can program or not. I want to find someone that can think out side the box. One other question I ask is, since I always look for someone that knows C# and C++, I ask them how would automate hooking up managed and unmanaged code without using CLI or Com.

  • 0

if else man .. ftw ... then again the most i did was arrays

That's the whole pitfall of FizzBuzz (unless you do duplicate checks, which is usually not wanted)

Given two integer variables, A and B, how could you swap their values without using a third variable? (This is my favourite. It wasn't actually given to me, but to my housemate at the time. He didn't get it, but the interviewer gave it to him to do on the train home, he figured it out on the train and emailed the answer to the interviewer, subsequently got the job :p)

Could you give the solution? Or is the solution language specific, like Python assigment:

A, B = B, A 

But still, internally I'm sure a temporary variable(s!) is being used.

EDIT: Forgot to add my solution.


void FizzBuzz()
{
for (int num = 1; num < 101; num ++)
{
bool multiple = false;
if (num % 3 == 0)
{
cout << "Fizz";
multiple = true;
}
if (num % 5 == 0)
{
cout << "Buzz";
multiple = true;
}
if (!multiple)
cout << num;
cout << endl;
}
}
[/CODE]

I'm still not sure if it's better to declare a variable outside of the loop, but I'm fairly sure it will be optimized by the compiler.

And my solution is fairly readable (I hope).

  • 0

Again it finds programmers that paid attention in school, doesn't mean they have good logic, just good retention :p.

I think asking a candidate to solve FizzBang with and without modulus is silly and defeats the point of the exercise. They just need to make sure they produce some code that solves the problem as expressed in plain English through whatever means necessary in a reasonable amount of time without making any of the common mistakes.

That way it does weed out 90% of those people that claim they can code when they can't.

  • 0

There's a cute trick with the xor operator but I don't see any value in testing if the candidate knows about it. If he can find it on the spot then that's certainly impressive, but is it really the kind of skills you're looking for? On modern CPUs this is even counter-productive compared to using a temporary variable, so it's a typical example of premature and misguided "optimization". I view this type of question as outdated and as an interviewee it'd raise doubts in my mind about the company.

Then I'd be inlined to say you missed the point of the question, which (of course only in my opinion) was to test an applicant's ability to think outside the box to create an alternative solution to a common textbook problem given a specific constraint. In the context of the job being applied for, it may also have been relevant (although I don't know for sure) since the job being applied for was to write software for very specialized hardware, which was very environmentally constrained (something to do with turbochargers IIRC).

Of course, in reality for most systems, saving 1-8 bytes of memory is pointless and complicates a simple problem, so temporary variables would be used. But there are certainly specific cases where optimisation like that is useful, especially in extremely memory constrained systems (embedded systems, for example) where the cost of an extra couple of cycles is worth the bytes saved.

Could you give the solution? Or is the solution language specific, like Python assigment:
A, B = B, A 

But still, internally I'm sure a temporary variable(s!) is being used.

Firey posted the solution that my housemate came up with. As rfirth said, if the sum of the values would be greater than INT_MAX, then the solution fails, but no specific values were provided, so I think the answer is reasonable. In fact, I'd say that a good follow up quesiton would have been "How would your solution for the question above react to the following test cases. Which cases, if any, would fail?".

  • 0

I've been asked that question. As soon as you give the solution using modulus, they ask you to do it again without using modulus/multiplication/division.

Only solution I can think of without using modulus/multiplication/division would be to loop subtracting the number each time until the number is less than that number and checking it for 0.

  • 0

Firey posted the solution that my housemate came up with. As rfirth said, if the sum of the values would be greater than INT_MAX, then the solution fails, but no specific values were provided, so I think the answer is reasonable. In fact, I'd say that a good follow up quesiton would have been "How would your solution for the question above react to the following test cases. Which cases, if any, would fail?".

Ah many thanks, completely missed it! I also remember now that it wasn't that 3 variables are mandatory for a swap, but at least 3 instructions are.

Also, I completely agree on the fact that when hiring programmers for highly constrained systems like a small embedded ARM board, things like a washing machine or even better example, car computer.

Working in such environments would require very safe code and there's very little overhead available. So doing such interview tests will filter out people who most likely won't be able to work on such projects.

  • 0

Then I'd be inlined to say you missed the point of the question, which (of course only in my opinion) was to test an applicant's ability to think outside the box to create an alternative solution to a common textbook problem given a specific constraint. In the context of the job being applied for, it may also have been relevant (although I don't know for sure) since the job being applied for was to write software for very specialized hardware, which was very environmentally constrained (something to do with turbochargers IIRC).

Of course, in reality for most systems, saving 1-8 bytes of memory is pointless and complicates a simple problem, so temporary variables would be used. But there are certainly specific cases where optimisation like that is useful, especially in extremely memory constrained systems (embedded systems, for example) where the cost of an extra couple of cycles is worth the bytes saved.

If the job involves designing algorithms for unorthodox CPUs, extremely memory constrained systems, or requires solid mastery of bitwise operations, then the question is useful, but either I missed something or no mention was made of the specific job for which this question was asked.

I would be very impressed if someone who has never heard of the trick before were able to find it on the spot in an interview. It's not a trivial algorithm. As far as testing "out-of-the-box" thinking goes, there are much better questions to ask. In general, the xor swap algorithm:

- Is slower than using a temporary variable

- Obfuscates the code

- Doesn't even result in any memory savings as optimizers can optimize a temporary variable away, perform exchange with a single XCHG x86 instruction, etc. See http://en.wikipedia.org/wiki/XOR_swap_algorithm#Reasons_for_avoidance_in_practice

There's something just wrong about expecting any programmer to know about an obscure algorithm that's generally best avoided in practice.

  • 0

If the job involves designing algorithms for unorthodox CPUs, extremely memory constrained systems, or requires solid mastery of bitwise operations, then the question is useful, but either I missed something or no mention was made of the specific job for which this question was asked.

I would be very impressed if someone who has never heard of the trick before were able to find it on the spot in an interview. It's not a trivial algorithm. As far as testing "out-of-the-box" thinking goes, there are much better questions to ask. In general, the xor swap algorithm:

- Is slower than using a temporary variable

- Obfuscates the code

- Doesn't even result in any memory savings as optimizers can optimize a temporary variable away, perform exchange with a single XCHG x86 instruction, etc. See http://en.wikipedia....nce_in_practice

There's something just wrong about expecting any programmer to know about an obscure algorithm that's generally best avoided in practice.

Like I said, I expect that the question was posed to see what answers the candidates could come up with, a "thinking outside the box" problem solving aptitude question, rather than a know the spec/processor/application question. A very very elementary question with a twist intended to remove the candidate from their comfort zone to see if they can think creatively. That's why I liked it anyway.

Then again, the job was writing systems (again IIRC) using RPG, and very old, highly constrained systems; so within the context of the job it may well have been relevant. Not every programming job has the luxury of optimizing compilers and x86 instruction sets.

  • 0

The one I use most often in interviews is "How would you crash the runtime/virtual machine for your favorite language (or the one we're using here)"

Whether you're using Java, C++, Objective C, MSIL, Python, damn near anything that isn't ANSI C is operating in some sort of a runtime environment - knowing where the weaknesses are and how you might exploit them to cause the runtime to crash (rather than your application) is a good test of their knowledge of the tools.

I don't necessarily expect an "this is the step-by-step guide", just a pretty good explanation of where they would go looking. "I know that the VM can leak memory if certain kinds of interproces communication goes wrong - I also know that I can force that communication to go wrong by doing x so I would check the buglist for issues in y and then?" It's the thought process that matters.

  • 0

I was curious about the FizzBuzz question, so I tried to do something a little more original.


void fizzBuzz()
{
foreach(i; 1 .. 100 + 1) switch((i % 3 == 0) + (i % 5 == 0) * 2)
{
default: writeln(i); break;
case 1: writeln("Fizz"); break;
case 3: write("Fizz");
case 2: writeln("Buzz");
}
}
[/CODE]

  • 0

Dang FizzBuzz. I had to do one once in Java and completed it in like 15 seconds using ternary operators. The most difficult part isnt the code, but rather the mindset of "how in the hell is this going to be applied".

  • 0

Wow, really? I would struggle to employ anyone I haven't met face to face. Just out of interest, how many of the candidates you employ turn out to be a waste of space?

Oddly enough, letting the applicant do the talking has worked out pretty well. I wish I had body language to read but just listening to them ask questions certainly hasn't resulted in any worse candidates and maybe even a better hiring average. I once had a calc instructor that graded strictly based on the questions a student asked and not on test scores. He believed that the deeper your understanding of something is, the level of the questions you ask will reflect that. Since I was over 30 at the time and already working in the industry I thought that was an interesting way to analyze a persons understanding of something. I've applied that here because I have no choice.

You'd be surprised. If you really understand what a developer candidate NEEDS to do in a position its easy to spot each persons skill levels and who can technically do the job. The problem is technically capable is not really what we look for. Even in previous companies with in person interviews, the most I'll ever really do is maybe a fizzbuzz. The average business application coder isn't doing rocket science. Every team I've been on in the last 16 years has basically done nothing more than schlep data from some DB to a UI and back. Scanning back on this thread, I looked at one of Dr_Asiks questions

"You have a cloud of points in 2d. Design an algorithm to draw the smallest circle that contains all the points."

Nope, haven't needed to analyze 2D points in 16 years, probably don't need a dev that can now. One of the 'trigger' things I may listen for as an example is what tool sets or frameworks they have used in the last year or so and how do they talk about them. Do they just hit the buzz words or do they really talk about them at a deeper level.

In practical terms, what we found to be important for us is:

  • Do they have an understanding of the fundamentals of whatever language/s we are using?
  • Can they/are they willing to learn?
  • Can they interact with end users?
  • Can they interact with business owners?
  • Are they a prima donna?

If the first four are yes and the last no, then we probably have a winner - assuming they can pass the background and drug test...

  • 0
Scanning back on this thread, I looked at one of Dr_Asiks questions

"You have a cloud of points in 2d. Design an algorithm to draw the smallest circle that contains all the points."

Nope, haven't needed to analyze 2D points in 16 years, probably don't need a dev that can now.

The question was for a game programming position, where the ability to design algorithms that work with points and vectors in 2D and 3D space is very important. Actually I was tasked to design such an algorithm during my internship there.

Also the answer to that is not particularly difficult:

A circle is defined by a center point and a radius. To find the center point, find Xmax, Xmin, Ymax, Ymin in your cloud of points, and your center is the point in the middle of that (Xmin + ((Xmax - Xmin) / 2), Ymin + ((Ymax - Ymin) / 2)).

Now the radius is the smallest one that ensures the circle contains all the points: it therefore has to be as long as the distance to the furthest away point. The distance from the center to a point is simply the norm of the Point-Center vector. Go over your cloud of points, calculate the distance from the center for each, select the largest. Done.

  • 0

Here are a couple of somewhat evil questions. I'd never ask them, but these are my favourites from discussions with my colleagues:

1. Given an RBGA pixel, with 8 bits per channel packing into a 32-bit integer, write a function which does saturated addition on two pixels.

2. In Java, write a function which takes a string and returns a string that is the input if the input is 6 characters or less, and the first 3 characters + "..." if it's greater than 6.

The first question is fairly straight forward. The second... that's an exercise for the reader.

  • 0

Here are a couple of somewhat evil questions. I'd never ask them, but these are my favourites from discussions with my colleagues:

1. Given an RBGA pixel, with 8 bits per channel packing into a 32-bit integer, write a function which does saturated addition on two pixels.

2. In Java, write a function which takes a string and returns a string that is the input if the input is 6 characters or less, and the first 3 characters + "..." if it's greater than 6.

The first question is fairly straight forward. The second... that's an exercise for the reader.

The second one isn't that hard... is it?

Pseudocode

String Foo(String bar)
{
    if (bar.Length &lt;= 6)
   	 return bar

    return bar.Substring(0, 3) + "..."
}

  • 0

MrA really? lol


String Shortten(String text) {
return text.Length <= 6 ? text : text.Substring(0, 3) + "...";
}
[/CODE]

Hehe. I guess I wasn't clear. It's a trick question (and arguably, poorly defined), and according to my friend, no-one's been able to answer it. I certainly couldn't answer it, but at least I understand why I can't answer it.

  • 0

Hehe. I guess I wasn't clear. It's a trick question (and arguably, poorly defined), and according to my friend, no-one's been able to answer it. I certainly couldn't answer it, but at least I understand why I can't answer it.

Huh? How is it a trick question? Seems extremely straight forward... what are we missing here?

  • 0

The question was for a game programming position, where the ability to design algorithms that work with points and vectors in 2D and 3D space is very important. Actually I was tasked to design such an algorithm during my internship there.

Also the answer to that is not particularly difficult:

A circle is defined by a center point and a radius. To find the center point, find Xmax, Xmin, Ymax, Ymin in your cloud of points, and your center is the point in the middle of that (Xmin + ((Xmax - Xmin) / 2), Ymin + ((Ymax - Ymin) / 2)).

Now the radius is the smallest one that ensures the circle contains all the points: it therefore has to be as long as the distance to the furthest away point. The distance from the center to a point is simply the norm of the Point-Center vector. Go over your cloud of points, calculate the distance from the center for each, select the largest. Done.

Actually, the problem is considerably harder than that. How do you know that aabb center is always the center of the smallest circle? It's not clear that there's a relationship between the two. Here's an example:

47gSc.png

The blue points are the point cloud, and the white subdivided box is their aabb (note the blue point in the upper-right corner). The red circle is the one described by your algorithm with red dot as center; the green circle with green dot as center is smaller (possibly the smallest) and still covers all points. Anyway, this problem is called the minimum bounding circle, and there are a lot of ways to approach it but it is basically an optimization problem.

  • 0
Anyway, this problem is called the minimum bounding circle, and there are a lot of ways to approach it but it is basically an optimization problem.
I hadn't thought of that, so thanks for the explanation. That said, now that I think about it, I don't think they mentionned it had to be smallest possible circle during the interview. That would've been kinda hard for an internship position. :p
  • 0

Hehe. I guess I wasn't clear. It's a trick question (and arguably, poorly defined), and according to my friend, no-one's been able to answer it. I certainly couldn't answer it, but at least I understand why I can't answer it.

The trick is that the naive algorithm only works with a monospace font. The extreme case, a string composed of 'i's, will hold much more letters than normal text in a certain amount of pixels. So you have to measure the text if you want to do it correctly.

This topic is now closed to further replies.
  • Recently Browsing   0 members

    • No registered users viewing this page.
  • Posts

    • Rufus 4.15.2393 Beta 2 by Razvan Serea Rufus is a small utility that helps format and create bootable USB flash drives, such as USB keys/pendrives, memory sticks, etc. Despite its small size, Rufus provides everything you need! Oh, and Rufus is fast. For instance it's about twice as fast as UNetbootin, Universal USB Installer or Windows 7 USB download tool, on the creation of a Windows 7 USB installation drive from an ISO (with honorable mention to WiNToBootic for managing to keep up). It is also marginally faster on the creation of Linux bootable USBs from ISOs. A non-exhaustive list of Rufus supported ISOs is available here. It can be especially useful for cases where: you need to create USB installation media from bootable ISOs (Windows, Linux, UEFI, etc.) you need to work on a system that doesn't have an OS installed you need to flash a BIOS or other firmware from DOS you want to run a low-level utility Rufus 4.15.2393 Beta 2 changelog: Add RISC-V 64 support to UEFI:NTFS Improve the guards for using the "silent" option Improve the ability to cancel during write retries Improve progress reporting for compressed image extraction Fix unrestricted XML entity expansion and integer overflow in ezxml parser (courtesy of @esadowski4) [GHSA-55r2-34wg-8mv9] Fix "silent" Windows installation failing at 75% in most cases [#2960] Fix a crash during boot when using UEFI:NTFS on Snapdragon X based ARM64 platforms [#2934] Fix the first WUE option always being checked by default [#2965] Fix an infinite loop when using Windows ISOs that contain multiple WIMs Fix "Enable runtime UEFI media validation" checkbox not always being properly enabled Other WUE improvements/fixes for OneDrive removal and username validation (with thanks to @christian8641) [#2984, #2991] Download: Rufus 4.15 Beta 2 | 1.9 MB (Open Source) Links: Rufus Home Page | Project Page @GitHub | Screenshot Get alerted to all of our Software updates on Twitter at @NeowinSoftware
    • Tixati 3.43 by Razvan Serea Tixati is a free and easy to use BitTorrent client featuring detailed views of all seed, peer, and file transfer properties. Also included are powerful bandwidth charting and throttling capabilities, and a full DHT implementation. Tixati is one of the most advanced and flexible BitTorrent clients available. And unlike many other clients, Tixati contains NO SPYWARE, NO ADS, and NO GIMMICKS. Tixati portable version is meant to run on a USB flash drive or other portable media. It stores all its configuration files in the same folder as the executable binary files, and all file paths are stored in a format relative to the program executable folder. It is important you do not delete the "tixati_portable_mode.txt" file within the executables folder. This file is what triggers Tixati to run in portable mode. (The executable binaries are actually the same as the standard edition binaries.) When running the portable edition from a USB flash drive, especially one that is formatted in FAT16/FAT32, you may experience some lag when initially loading a new transfer. This is because initializing and allocating large files on flash-based media consumes a greater amount of time and resources compared to a conventional hard-drive. Tixati has the following features: detailed views of all aspects of the swarm, including peers, pieces, files, and trackers support for magnet links, so no need to download .torrent files if a simple magnet-link is available super-efficient peer choking/unchoking algorithms ensure the fastest downloads peer connection encryption for added security full DHT (Distributed Hash Table) implementation for trackerless torrents, including detailed message traffic graphs and customizable event logging advanced bandwidth charting of overall traffic and per-transfer traffic, with separate classification of protocol and file bytes, and with separate classification of outbound traffic for trading and seeding highly flexible bandwidth throttling, including trading/seeding proportion adjustment and adjustable priority for individual transfers and peers bitfield graphs that show the completeness of all downloaded files, what pieces other peers have available, and the health of the overall swarm customizable event logging for each download, and individual event logs for all peers within the swarm expert local file management functions which allow you to move files to a different partition even while downloading is still in progress 100% compatible with the BitTorrent protocol Windows and Linux-GTK native versions available Tixati 3.43 changelog: Several major DHT improvements Added several screening heuristics to filter malicious DHT nodes, prevent Sybil floods Rewrote DHT search algorithms to add support for multi-path lookups Improved DHT logging, more details in several error messages Extended timeout lengths for outgoing queries over I2P Added incoming query / response per second to DHT table status display Updated Regex engine to PCRE2 Faster Search function, scans channel user profiles in much less time Fixed problems with file name parsing and date handling in RSS Faster and more accurate RSS filtering and episode number detection Several optimizations to global text processing functions, such as UTF-8 cleaning, line splitting, and token parsing Complete update of port-mapping UPNP/NAT-PMP engine, added PCP support, mapping over VPN support, and more Several refinements to default gateway detection on Windows / Android, which is used for port-mapping Support for IPv6 interface-scoped addresses, which is sometimes needed for IPv6 gateway detection and port mapping Full support for PCP port remapping, added backup zero-port query in case requested port is rejected New UPNP/NAT-PMP Monitor in Help > Diagnostics New reflected local port/location tracker that analyzes DHT replies to detect true port/location and NAT mapping type New TCP/UDP Ports monitor in Help > Diagnostics, with several statistic and information tabs, and a detailed event log Calculated/reflected local port is now used for port parameter in tracker queries and peer handshake Fixed several problems with Linux Wayland compatibility Completely replaced tray icon functions in Linux, new SNI implementation is now the default with GSI backup Implemented full DBus-Menu server to be used by new SNI tray icon implementation Replaced Linux tray balloon notification DBus client Rewrote auto-shutdown DBus interface for Linux Rewrote sleep inhibit DBus interface for Linux Dropped deprecated Linux dbus-glib dependencies Completely new Windows asynchronous file handling, now using IOCP model with several block-alignment optimizations Better handling of system network resets and interface down/up cycles Added option to fully clear configuration in Settings > Import/Export Remember last option checkboxes when using Import/Export Fixed minor I2P incoming connection routing problems Much faster I2P vanity host name finder Much faster channel user vanity key finder Raised length limit for torrent tracker remote failure messages to 120 from 64 Fixed problems setting download location on a torrent before the meta info is resolved Added location/MOC paths to category pane tooltips Several minor Web Interface fixes Refinements to static and scrolling ellipsizing layout routines Several fixes and improvements to single and multi-line text edit controls Many other minor fixes throughout the user interface A major overhaul of the Android framework has also been done: API target raised to 35, page alignment set to 16K Rewrote all inset processing routines Full rewrite of foreground service, application, and main activity objects New permission request routines Added multi-cast lock request before UPNP/LPDP discovery operations Fixed file permission and locking problems when loading .torrent from web browsers Fixed problems with Z-ordering of modal / non-modal and popup windows Fixed handling of back gesture on newer OS Added status bar icon adjustment based on status bar background color Added option in Settings > UI > Behavior to continue running in tray when task removed from recents App can be closed by swiping away notification Rewrote IME interface, fixed several problems with auto-correct, on-screen keyboard visibility, and cursor positioning Added full support for Android hardware mouse and keyboard function Added full tooltip implementation for Android hovering via mouse or other cursor device Full rewrite of popup menu widgets to better support hardware pointers and keyboard Added mouse cursor updating framework for Android hovering Added Settings > Import/Export to Android builds Added language file support to Android builds Download: Tixati 64-bit | Tixati 32-bit ~20.0 MB (Freeware) Download: Portable Tixati 3.43 | 114.0 MB Download: Tixati 3.43 for Linux | Android View: Tixati Website | Screenshot Get alerted to all of our Software updates on Twitter at @NeowinSoftware
    • Firefox 152.0.1 by Razvan Serea Firefox is a fast, full-featured Web browser. It offers great security, privacy, and protection against viruses, spyware, malware, and it can also easily block pop-up windows. The key features that have made Firefox so popular are the simple and effective UI, browser speed and strong security capabilities. Firefox has complete features for browsing the Internet. It is very reliable and flexible due to its implemented security features, along with customization options. Firefox includes pop-up blocking, tab-browsing, integrated Google search, simplified privacy controls, a streamlined browser window that shows you more of the page than any other browser and a number of additional features that work with you to help you get the most out of your time online. Firefox key features Enhanced Tracking Protection (ETP) – Blocks trackers, cookies, cryptominers, and fingerprinters by default. Private Browsing Mode – Deletes history, cookies, and temporary files when closed. Lightweight & Fast Performance – Optimized memory usage with efficient page loading. Cross-Platform Sync – Sync bookmarks, passwords, history, and open tabs across devices. Customizable Interface – Toolbars, themes, and extensions can be tailored to user needs. Strong Privacy Controls – Options to manage cookies, permissions, and site data easily. Reader Mode – Strips away clutter for distraction-free reading. Pocket Integration – Save and read articles offline with Pocket built into Firefox. Picture-in-Picture (PiP) – Watch videos in a floating window while multitasking. Extensions & Add-ons – Vast library for productivity, security, and personalization. Built-in PDF Viewer – No need for external software to view PDFs. Firefox Monitor – Alerts users if their email is part of a known data breach. Multi-Account Containers – Isolate browsing sessions (e.g., work, personal, shopping). Performance & Resource Efficiency – Uses fewer system resources than some competitors. Open Source & Community-Driven – Transparent development with global contributions. Firefox 152.0.1 fixes: Fixed frequent crashes affecting users with Intel Raptor Lake processors. (Bug 2039575) Fixed an issue on macOS where choosing a PDF option, such as "Save as PDF", from the system print dialog would send the job to your printer instead of saving a file. (Bug 2047850) Download: Firefox 64-bit | Firefox 32-bit | ARM64 | ~70.0 MB (Freeware) Download: Firefox for MacOS | 146.0 MB View: Firefox Home Page | Release Notes Get alerted to all of our Software updates on Twitter at @NeowinSoftware
    • Zed 1.7.2 has landed with updated OpenCode models, bug fixes and other improvements by David Uzondu Zed 1.7.2 recently landed on the stable release channel, bringing a host of AI-related features including automatic context compaction and settings-based skill management, along with other things like better Markdown preview rendering and custom git commands in the graph view. Starting with the AI stuff, the developers introduced "/compact", a command that basically summarizes your conversation history on demand. This tool prevents your active chat window from hitting token limits by compressing older parts of the dialogue into a brief overview. In addition to that, the team relocated skill management to the settings UI, improving how the application communicates errors regarding those skills, and updated the OpenCode model roster to support DeepSeek V4 Flash, MiniMax M3, Qwen 3.7 Plus, and Nemotron 3 Ultra Free. External agent users can also monitor context window cost metrics and delete individual sessions directly from their history. Right-clicking ref labels in the git graph now opens a context menu that runs different actions against selected targets, kind of how VS Code does it. Here are some of the bug fixes this new release brings: The active agent fails to auto-select when creating a new git worktree. A scrollbar unexpectedly appears on wrapped code blocks in the agent chat. Collapse indicators for project headers appear when performing sidebar searches. Bracketed ellipsis title prefixes fail to show the ellipsis icon properly. Project icons render incorrectly in the recent projects picker. Diff hunk controls appear inside non-editable commit view multibuffers. The software update button hangs indefinitely on the downloading stage. Restoring an agent terminal in a remote project triggers a sudden crash. Splitting a pane that contains an active commit view causes a crash. Linux Wayland freezes when trying to read the clipboard from laggy external apps. Zed is a "newish" code editor trying to break the massive stronghold VS Code has on the developer community. Funny enough, the editor was created by former GitHub employees who worked on the Atom text editor (which Microsoft killed in 2022, several years after it bought GitHub). The project officially hit version 1.0 back in April, introducing platform parity for Windows and Linux alongside deep support for DeepSeek-V4-Pro.
    • 26H2 absolutely will support ARM Windows just not on devices that came with 26H1. This is evident by the fact I am running 26H2, which on my MacBook Neo and Surface Pro 12 (inch), within a VM.
  • Recent Achievements

    • One Year In
      hhgygy earned a badge
      One Year In
    • One Month Later
      AMV earned a badge
      One Month Later
    • Week One Done
      AMV earned a badge
      Week One Done
    • Collaborator
      ryansurfer98 went up a rank
      Collaborator
    • One Month Later
      Eurosoft10 earned a badge
      One Month Later
  • Popular Contributors

    1. 1
      +primortal
      523
    2. 2
      +Edouard
      172
    3. 3
      PsYcHoKiLLa
      78
    4. 4
      Steven P.
      72
    5. 5
      Michael Scrip
      71
  • Tell a friend

    Love Neowin? Tell a friend!