# dsa

Published articles for dsa.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## How Big Tech Interview Decisions and Rounds Work

DevFeed: [How Big Tech Interview Decisions and Rounds Work](<https://devfeed.tech/articles/how-big-tech-interviews-actually-work-39676.md>)

Original publisher: [Read original article](<https://www.gauravsarma.com/random/2026-04-21_how-big-tech-interviews-work>)

Published: 2026-04-21T00:00:00Z

Content type: article

Language: en

Sources: [Gaurav Sarma's Blog](<https://devfeed.tech/sources/gaurav-sarma-s-blog.md>)

Topics: [Code](<https://devfeed.tech/topics/code.md>), [Architecture & Design](<https://devfeed.tech/topics/architecture-design.md>), [test-coverage](<https://devfeed.tech/topics/test-coverage.md>), [Scalability](<https://devfeed.tech/topics/scalability.md>)

Tags: [api-integration](<https://devfeed.tech/tags/api-integration.md>), [bug](<https://devfeed.tech/tags/bug.md>), [career](<https://devfeed.tech/tags/career.md>), [clean-code](<https://devfeed.tech/tags/clean-code.md>), [dsa](<https://devfeed.tech/tags/dsa.md>), [faang](<https://devfeed.tech/tags/faang.md>), [interview](<https://devfeed.tech/tags/interview.md>), [interviews](<https://devfeed.tech/tags/interviews.md>), [system-design](<https://devfeed.tech/tags/system-design.md>), [tech](<https://devfeed.tech/tags/tech.md>), [test-coverage](<https://devfeed.tech/tags/test-coverage.md>)

### AI overview

The article explains how big tech interviews are evaluated. Interviewers assess specific signals independently across coding, system design, and project-focused rounds, then discuss the combined feedback in a panel. Communication, code quality, edge-case handling, problem-solving instincts, scalability, and trade-off analysis can affect the decision, not just whether a problem is solved.

### Source excerpt

Having worked at a few big tech companies and having interviewed candidates for them as well, here are some things I wish more candidates knew going in. How decisions are actually made Each interviewer is assigned a round and for every round, there are specific signals they need to collect...

## Launching comprehensive resources to master coding interviews

DevFeed: [Launching comprehensive resources to master coding interviews](<https://devfeed.tech/articles/launching-comprehensive-resources-to-master-coding-interviews-33573.md>)

Original publisher: [Read original article](<https://blog.algomaster.io/p/launching-comprehensive-resources>)

Author: Ashish Pratap Singh

Published: 2026-04-05T13:30:09Z

Content type: release

Language: en

Sources: [AlgoMaster Newsletter](<https://devfeed.tech/sources/algomaster-newsletter.md>)

Topics: [coding](<https://devfeed.tech/topics/coding.md>), [LeetCode](<https://devfeed.tech/topics/leetcode.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [c-plus-plus](<https://devfeed.tech/tags/c-plus-plus.md>), [c-sharp](<https://devfeed.tech/tags/c-sharp.md>), [coding](<https://devfeed.tech/tags/coding.md>), [courses](<https://devfeed.tech/tags/courses.md>), [dsa](<https://devfeed.tech/tags/dsa.md>), [javascript](<https://devfeed.tech/tags/javascript.md>), [launch](<https://devfeed.tech/tags/launch.md>), [python](<https://devfeed.tech/tags/python.md>), [typescript](<https://devfeed.tech/tags/typescript.md>)

### AI overview

AlgoMaster launches a collection of resources for data structures and algorithms study and coding interview preparation, including a problem list, course, company-specific practice, animations, an AI-powered coding interview simulator, and an in-platform code editor and evaluation feature.

### Source excerpt

I'm excited to launch a comprehensive set of resources on algomaster.io to help you master DSA and prepare for coding interviews:

## Signing Git commits and tags with SSH

DevFeed: [Signing Git commits and tags with SSH](<https://devfeed.tech/articles/signing-git-commits-and-tags-with-ssh-37723.md>)

Original publisher: [Read original article](<https://carlosbecker.com/posts/git-ssh-signing/>)

Author: Carlos Alexandro Becker

Published: 2025-11-19T00:00:00Z

Content type: tutorial

Language: en

Sources: [Carlos Becker](<https://devfeed.tech/sources/carlos-becker.md>)

Topics: [Git](<https://devfeed.tech/topics/git.md>), [ssh](<https://devfeed.tech/topics/ssh.md>), [ECDSA](<https://devfeed.tech/topics/ecdsa.md>), [ed25519](<https://devfeed.tech/topics/ed25519.md>)

Tags: [dsa](<https://devfeed.tech/tags/dsa.md>), [ecdsa](<https://devfeed.tech/tags/ecdsa.md>), [ed25519](<https://devfeed.tech/tags/ed25519.md>), [git](<https://devfeed.tech/tags/git.md>), [rsa](<https://devfeed.tech/tags/rsa.md>), [signing](<https://devfeed.tech/tags/signing.md>), [ssh](<https://devfeed.tech/tags/ssh.md>)

### AI overview

The article explains that Git commits and tags can be signed with SSH keys instead of GPG. It states that Ed25519, ECDSA, and RSA keys are supported, while DSA keys are not.

### Source excerpt

You can sign Git commits and tags with SSH keys instead of GPG.

## Elliptic Curve Cryptography: breaking security and a comparison with RSA

DevFeed: [Elliptic Curve Cryptography: breaking security and a comparison with RSA](<https://devfeed.tech/articles/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa-27104.md>)

Original publisher: [Read original article](<https://andrea.corbellini.name/2015/06/08/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa/>)

Author: andreacorbellini

Published: 2015-06-08T13:28:00Z

Content type: article

Language: en

Sources: [Andrea Corbellini](<https://devfeed.tech/sources/andrea-corbellini.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Algorithms, Complexity](<https://devfeed.tech/topics/algorithms-complexity.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [ECDSA](<https://devfeed.tech/topics/ecdsa.md>), [Security](<https://devfeed.tech/topics/security.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [comparison](<https://devfeed.tech/tags/comparison.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [dh](<https://devfeed.tech/tags/dh.md>), [dsa](<https://devfeed.tech/tags/dsa.md>), [ecc](<https://devfeed.tech/tags/ecc.md>), [ecdh](<https://devfeed.tech/tags/ecdh.md>), [ecdhe](<https://devfeed.tech/tags/ecdhe.md>), [ecdsa](<https://devfeed.tech/tags/ecdsa.md>), [hash](<https://devfeed.tech/tags/hash.md>), [introduction](<https://devfeed.tech/tags/introduction.md>), [rsa](<https://devfeed.tech/tags/rsa.md>), [security](<https://devfeed.tech/tags/security.md>), [series](<https://devfeed.tech/tags/series.md>)

### AI overview

This fourth and final post in a series examines how practical techniques attack the elliptic-curve discrete logarithm problem, focusing on baby-step, giant-step and Pollard's rho methods. It then compares the need for elliptic-curve cryptography with RSA-based cryptosystems.

### Source excerpt

This post is the fourth and last in the series ECC: a gentle introduction. In the last post we have seen two algorithms, ECDH and ECDSA, and we have seen how the discrete logarithm problem for elliptic curves plays an important role for their security. But, if you remember, we said that we have no mathematical proofs for the complexity of the discrete logarithm ...

## Elliptic Curve Cryptography: ECDH and ECDSA

DevFeed: [Elliptic Curve Cryptography: ECDH and ECDSA](<https://devfeed.tech/articles/elliptic-curve-cryptography-ecdh-and-ecdsa-27103.md>)

Original publisher: [Read original article](<https://andrea.corbellini.name/2015/05/30/elliptic-curve-cryptography-ecdh-and-ecdsa/>)

Author: andreacorbellini

Published: 2015-05-30T19:23:00Z

Content type: tutorial

Language: en

Sources: [Andrea Corbellini](<https://devfeed.tech/sources/andrea-corbellini.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [ECDSA](<https://devfeed.tech/topics/ecdsa.md>), [math](<https://devfeed.tech/topics/math.md>), [Security, Privacy and Abuse Prevention](<https://devfeed.tech/topics/security-privacy-and-abuse-prevention.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [attacks](<https://devfeed.tech/tags/attacks.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [dh](<https://devfeed.tech/tags/dh.md>), [dsa](<https://devfeed.tech/tags/dsa.md>), [ecc](<https://devfeed.tech/tags/ecc.md>), [ecdh](<https://devfeed.tech/tags/ecdh.md>), [ecdhe](<https://devfeed.tech/tags/ecdhe.md>), [ecdsa](<https://devfeed.tech/tags/ecdsa.md>), [hash](<https://devfeed.tech/tags/hash.md>), [math](<https://devfeed.tech/tags/math.md>), [parameter](<https://devfeed.tech/tags/parameter.md>), [points](<https://devfeed.tech/tags/points.md>), [random](<https://devfeed.tech/tags/random.md>), [security](<https://devfeed.tech/tags/security.md>), [smart](<https://devfeed.tech/tags/smart.md>), [tls](<https://devfeed.tech/tags/tls.md>)

### AI overview

This tutorial applies elliptic-curve mathematics over finite fields to cryptography, introducing domain parameters and explaining how random seeds can generate curve parameters or base points. It also discusses weak curves and Smart's attack on the discrete logarithm problem.

### Source excerpt

This post is the third in the series ECC: a gentle introduction. In the previous posts, we have seen what an elliptic curve is and we have defined a group law in order to do some math with the points of elliptic curves. Then we have restricted elliptic curves to finite fields of integers modulo a prime. With this restriction, we have seen that ...

## Elliptic Curve Cryptography: a gentle introduction

DevFeed: [Elliptic Curve Cryptography: a gentle introduction](<https://devfeed.tech/articles/elliptic-curve-cryptography-a-gentle-introduction-27101.md>)

Original publisher: [Read original article](<https://andrea.corbellini.name/2015/05/17/elliptic-curve-cryptography-a-gentle-introduction/>)

Author: andreacorbellini

Published: 2015-05-17T11:24:00Z

Content type: article

Language: en

Sources: [Andrea Corbellini](<https://devfeed.tech/sources/andrea-corbellini.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [ECDSA](<https://devfeed.tech/topics/ecdsa.md>), [public key](<https://devfeed.tech/topics/public-key.md>), [Algorithms, Complexity](<https://devfeed.tech/topics/algorithms-complexity.md>), [Encryption](<https://devfeed.tech/topics/encryption.md>)

Tags: [bitcoin](<https://devfeed.tech/tags/bitcoin.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [dh](<https://devfeed.tech/tags/dh.md>), [dsa](<https://devfeed.tech/tags/dsa.md>), [ecc](<https://devfeed.tech/tags/ecc.md>), [ecdh](<https://devfeed.tech/tags/ecdh.md>), [ecdsa](<https://devfeed.tech/tags/ecdsa.md>), [examples](<https://devfeed.tech/tags/examples.md>), [guide](<https://devfeed.tech/tags/guide.md>), [math](<https://devfeed.tech/tags/math.md>), [pgp](<https://devfeed.tech/tags/pgp.md>), [public-key](<https://devfeed.tech/tags/public-key.md>), [rsa](<https://devfeed.tech/tags/rsa.md>), [security](<https://devfeed.tech/tags/security.md>), [ssh](<https://devfeed.tech/tags/ssh.md>), [tls](<https://devfeed.tech/tags/tls.md>), [tools](<https://devfeed.tech/tags/tools.md>), [web](<https://devfeed.tech/tags/web.md>)

### AI overview

A gentle introduction to elliptic curve cryptography explains elliptic curves, their use in public-key cryptography, and why ECC is considered secure. The series covers finite fields, the discrete logarithm problem, ECDH, ECDSA, attacks on ECC, and comparisons with RSA.

### Source excerpt

Those of you who know what public-key cryptography is may have already heard of ECC, ECDH or ECDSA. The first is an acronym for Elliptic Curve Cryptography, the others are names for algorithms based on it. Today, we can find elliptic curves cryptosystems in TLS, PGP and SSH, which are just three of the main technologies on which the modern web and IT world ...