Skip to content

A backend-focused DSA test series designed to strengthen problem-solving skills in arrays, strings, trees, graphs, and algorithms for the 2024–2025 academic year.

Notifications You must be signed in to change notification settings

Harshbhagat22/SHL-Automata-Tests-2024-2025

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

SHL-Automata-Tests-2024-2025

⚙️ A structured problem-solving test series focused on Data Structures and Algorithms (DSA).
🧠 Designed to build strong backend logic skills for technical interviews, coding rounds, and academic evaluations.


📘 About the Test Series

The SHL-Automata-Tests-2024-2025 is a curated set of DSA problems aimed at assessing and improving your core programming abilities. Each problem challenges your understanding of fundamental concepts, logical thinking, and efficiency in solving real-world backend problems.


🗂️ What’s Included

  • ✅ Problem statements with constraints and edge cases
  • ✅ Categorized topics: Arrays, Strings, Trees, Graphs, Recursion, DP, etc.
  • ✅ Input/output-based problem format
  • ✅ Suitable for JavaScript, Python, Java, and C++ solutions

🎯 Objectives

  • Practice writing clean, efficient backend logic
  • Strengthen grasp of algorithms and data structures
  • Simulate real-world coding test scenarios
  • Build a solid foundation for software engineering roles

📅 Valid For

Academic Year: 2024 – 2025

Used for backend-focused assessments, internal evaluations, and interview prep.


🧪 How to Use

  1. Choose a problem from the problem set.
  2. Solve it in your preferred language.
  3. Test your solution using sample inputs and expected outputs.
  4. (Optional) Track your progress or submit for review.

🙋 Need Help?

For support or submissions, contact:
📧 [email protected]
🔗 github.com/Harsh

About

A backend-focused DSA test series designed to strengthen problem-solving skills in arrays, strings, trees, graphs, and algorithms for the 2024–2025 academic year.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published