Microsoft SWE Intern, Late 2025: 47 Experiences (Part 3 of 6)
- Company
- Microsoft
- Reports
- 47 interview reports
- Level
- Internship
- Stages
- OA → Phone screen → Onsite
Microsoft SWE intern reports from October to December 2025: behavioral and résumé questions led, with the most CS-fundamentals questions of any part.
At a glance
- Process: OA, phone and HR screens, then interview rounds; two US candidates were moved straight to the final round and both got offers.
- Asked: behavioral questions in 21 of these 47 reports and résumé talk in 19; 13 asked CS fundamentals such as how a doubly linked list works or how a negative number is stored in binary.
- More: the question tables for all 232 reports, the regional notes and the patterns are in Part 1.
Coverage: Internship cohort, Software Engineering Intern role, reports 103–149, dated October 2025 to December 28, 2025. None is from the Security & Identity internship. Locations: US 18, India 9, not stated 6, Serbia 3, Romania 3, Israel 2, Ireland 2, and one each from Norway, France, Australia and Egypt. Stages: OA, phone and HR screens, interview rounds and finals. Dates are report dates unless a report gives an interview date; nine reports carry only a month.
In this series
- Part 1: Software Engineering Intern reports 01–48, July to November 2026. Also has the overview, question tables, regional notes and patterns for all 232 Software Engineering Intern reports.
- Part 2: Software Engineering Intern reports 49–102, January to June 2026.
- Part 3 (current): Software Engineering Intern reports 103–149, October to December 2025.
- Part 4: Software Engineering Intern reports 150–191, July to September 2025.
- Part 5: Software Engineering Intern reports 192–232, January to June 2025 (plus one dated only to 2025).
- Part 6: The other internship programs: Explore Intern (1 report), Student Software Engineer roles in Israel and Denmark (10) and one SWE Co-op (1).
What came up
Behavioral questions (21 of 47) and resume talk (19) led again. This stretch also has the most CS fundamentals of any part: 13 of the 47 reports mention OS, OOP, DBMS or concept questions such as how a doubly linked list works or how a negative number is stored in binary.
| Topic | Reports | Last seen |
|---|---|---|
| Behavioral and motivation questions | 21 of 47 | Dec 2025 (report date) |
| Resume, project and past-internship deep dives | 19 of 47 | Dec 2025 (report date) |
| CS fundamentals (OS, OOP, DBMS, networks) | 13 of 47 | Dec 2025 (report date) |
| Strings | 9 of 47 | Dec 2025 (report date) |
| Linked lists | 8 of 47 | Dec 2025 (report date) |
| Dynamic programming | 8 of 47 | Dec 2025 (report date) |
| Trees, BSTs and tries | 6 of 47 | Dec 2025 (report date) |
| Arrays and hashing | 6 of 47 | Dec 2025 (report date) |
| Design a data structure or class (LRU, trie, setAll, hash map) | 5 of 47 | Dec 2025 (report date) |
| System and low-level design | 5 of 47 | Dec 2025 (report date) |
| Stacks, queues and heaps | 4 of 47 | Dec 2025 (report date) |
| Sliding window and two pointers | 4 of 47 | Nov 2025 (report date) |
| Binary search | 3 of 47 | Dec 2025 (report date) |
| Graphs, BFS/DFS and dependency ordering | 3 of 47 | Nov 2025 (report date) |
| Math, bits and puzzles | 2 of 47 | Dec 2025 (report date) |
| Grids and matrices | 2 of 47 | Nov 2025 (report date) |
| Greedy and backtracking | 1 of 47 | Nov 2025 (report date) |
A report can count toward several topics. The counts use this part's 47 reports.
Questions we found
These tables cover only this part's 47 reports. Part 1 has the tables for all 232 Software Engineering Intern reports.
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| LRU Cache | 1: 106 | Dec 2025 (report date) |
| Validate Binary Search Tree | 1: 113 | Dec 2025 |
| Reverse Nodes in k-Group | 1: 112 | Dec 2025 |
| Integer square root | 1: 113 | Dec 2025 |
| Longest Increasing Subsequence | 1: 114 | Dec 2025 (report date) |
| Implement a trie | 1: 114 | Dec 2025 (report date) |
| Map with O(1) get, set and setAll | 1: 116 | Nov 2025 (report date) |
| Longest buy-to-sell span with a profit | 1: 119 | Nov 2025 |
| Valid Parentheses | 1: 121 | Nov 2025 (report date) |
| Find Peak Element | 1: 121 | Nov 2025 |
| Sort a list with no extra memory, then explain quicksort | 1: 123 | Nov 2025 |
| Implement malloc and free over a fixed buffer | 1: 124 | Nov 2025 |
| Minimum-cost path through a grid | 1: 129 | Nov 2025 |
| Isomorphic Strings | 1: 132 | Nov 2025 (report date) |
| Minimum Size Subarray Sum | 1: 134 | Oct 2025 |
| Implement Dijkstra's algorithm from scratch | 1: 137 | Oct 2025 |
| Top K Frequent Elements | 1: 146 | Oct 2025 (report date) |
| Longest Common Subsequence | 1: 145 | Oct 2025 |
| Check whether a number is divisible by 5 | 1: 141 | Oct 2025 |
Low-Level Design (LLD/OOD)
| Question | Reports | Last seen |
|---|---|---|
| Design a stock market system in Python | 1: 109 | Dec 2025 |
Behavioral (BQ)
| Question | Reports | Last seen |
|---|---|---|
| Why Microsoft? / Why do you want to join Microsoft? (practice) | 2: 122, 139 | Nov 2025 (report date) |
| A technical challenge, or the hardest problem you solved (practice) | 2: 131, 140 | Nov 2025 (report date) |
| A time you disagreed with a teammate (practice) | 1: 104 | Dec 2025 (report date) |
| Your most impactful project (practice) | 1: 105 | Dec 2025 |
| Which CS fundamentals interest you most? (practice) | 1: 107 | Dec 2025 |
| A time you worked remotely on something (practice) | 1: 117 | Nov 2025 |
| A challenge you faced working in a team (practice) | 1: 125 | Nov 2025 |
| Tell me about yourself | 1: 131 | Nov 2025 |
| Something negative you have done (practice) | 1: 131 | Nov 2025 |
CS fundamentals (concept questions)
| Question | Reports | Last seen |
|---|---|---|
| OOP principles (the four pillars) | 3: 118, 128, 131 | Nov 2025 |
| How do you represent a negative number in binary? | 1: 103 | Dec 2025 |
| How a doubly linked list works | 1: 108 | Dec 2025 |
| How sift-up works in a heap | 1: 110 | Dec 2025 |
| Java vs. C++ vs. C | 1: 118 | Nov 2025 |
| Stack vs. queue | 1: 119 | Nov 2025 |
| Unit tests, black-box vs. white-box testing | 1: 130 | Nov 2025 |
47 detailed candidate timelines, loops, and screens
103: Three rounds in a day, ending on negative numbers in binary
Report date: 2025-12-28 · Role: Software Engineer (Internship) · Location: Not stated · Result: Offer
HR call
Three rounds on one day
- Round 1: algorithm coding.
- Round 2: algorithm coding.
- Round 3: a free-form chat that included how you represent a negative number in binary.
104: Redmond — two 30-minute rounds where the approach mattered most
Report date: 2025-12-22 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: Offer
Two back-to-back 30-minute interviews
- A time you disagreed with a teammate, and how you resolved it (as the candidate remembered it).
- An easy coding question. The approach counted for more than finishing.
Their routine: restate the problem, explain the approach, walk an example, then code and write edge-case tests. The offer came two weeks later; about four weeks end to end.
105: Codility OA, then three 45-minute interviews
Report date: 2025-12-20 · Role: Software Engineer (Internship) · Location: Not stated · Channel: Applied online · Result: Offer
Online assessment (Codility, 2 problems: one easy, one medium)
Three interviews (about 45 minutes each, roughly a month after the OA)
- About 15 minutes of behavioral in each, including your most impactful project.
- A medium coding problem in each interview.
Results came a week later; about two months end to end.
106: An hour on the resume and an LRU cache, then binary search
Report date: 2025-12-19 · Role: Software Engineer (Internship) · Location: Not stated · Channel: Applied online · Result: Offer
Round 1 (1 hour)
- Introduction and a grilling on resume projects.
- LRU Cache.
Round 2 (40 minutes)
- One binary-search question.
107: Kurukshetra campus — which fundamentals do you like?
Report date: 2025-12-17 · Role: Software Engineer (Internship) · Location: Kurukshetra, India · Channel: University channel · Result: No offer
Online assessment (2 problems)
Technical round
Technical + HR round
108: Oslo — a screen, logic tests, then onsite
Report date: 2025-12-13 · Role: Software Engineer (Internship) · Location: Oslo, Norway · Channel: Applied online · Result: No offer
Non-technical screen
Remote logic tests
Onsite interviews (travel covered)
- Explain how a doubly linked list works.
About four weeks end to end.
109: No OA — a stock market design in Python
Report date: 2025-12-11 · Role: Software Engineer (Internship) · Location: Not stated · Result: Offer
Two back-to-back 1-hour interviews (no OA)
- How would you design a stock market system in Python?
The offer showed up in the portal within one to two weeks.
110: Belgrade — three interviews, each starting with your projects
Report date: 2025-12-10 · Role: Software Engineer (Internship) · Location: Belgrade, Serbia · Channel: Applied online · Result: Offer
Online coding task
Three 45-minute interviews (technical plus behavioral)
- The first 15 minutes of each went to personal projects and university.
- Coding problems (not named).
- How does sift-up (up-heap) correction work in a heap?
About three months end to end.
111: Redmond — half behavioral, half coding, and a deep resume dig
Report date: 2025-12-09 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: Offer
Online assessment
Two final interviews, each half behavioral and half coding
- Very deep questions on resume experience.
112: San Francisco — k-group reversal and a resume round
Report date: 2025-12-07 · Role: Software Engineer (Internship) · Location: San Francisco, California, US · Result: No offer
Technical round(s)
- Reverse a linked list in groups of k.
- Basic linked-list and tree problems.
Resume deep-dive round
113: Seattle — a square root and a BST check in 50 minutes
Report date: 2025-12-07 · Role: Software Engineer (Internship) · Location: Seattle, Washington, US · Result: Offer
Technical interview (about 50 minutes, 2 problems)
114: LIS and a trie
Report date: 2025-12-04 · Role: Software Engineer (Internship) · Location: Not stated · Result: Offer
Interview (round count not given)
- Longest Increasing Subsequence.
- Build a trie.
- Core CS concepts, a project walk-through and technical follow-ups.
115: Redmond — a two-part superday, arrays and strings only
Report date: 2025-12-01 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: No offer
Online assessment
Two-part superday (two 45-minute one-on-ones with engineers, no behavioral questions)
- Array and string coding questions.
116: Israel — home assignment, then three Teams interviews
Report date: 2025-11-30 · Role: Intern - Software Engineer · Location: Israel · Channel: University channel · Result: No offer
Home assignment (about 2 hours)
Three 75-minute interviews on Teams, all on one day
A university channel started the process; about four weeks end to end. The same setAll task shows up in other reports from Israel.
117: Boston — straight to the final, and a shifting API question
Report date: 2025-11-29 · Role: Software Engineer (Internship) · Location: Boston, Massachusetts, US · Channel: Applied online · Result: Offer
Two back-to-back final interviews (they skipped straight to the final)
- A medium coding problem on the easier side.
- An API design question. The interviewer mixed up two endpoints that were really the same thing under different names, and changed the question partway through.
- Tell me about a time you worked remotely on something.
The candidate had a bad experience with one interviewer. About two weeks end to end.
118: India on-campus, summer 2026 — topics only, heavy on fundamentals
Report date: 2025-11-28 (applied July 2025) · Role: SDE Intern, Core CS track · Location: India (on-campus) · Result: Offer
The candidate kept the exact questions private and shared topics only.
Shortlist on resume and CGPA.
OA (2 questions): an easy array implementation, and a medium sliding-window problem where time complexity mattered.
Technical round 1 (45 minutes, about 30 of them coding)
- Intro, then OOP: the four pillars and how they differ.
- Java vs. C++ vs. C: syntax, memory model, runtime behavior.
- A small OOP case study: model a scenario and pick data structures (a linked list and a B+ tree came up).
- A DBMS scenario: model the data and choose how to store it, with no SQL.
- Quick OS questions: frames, page faults, virtual memory.
- One medium grid problem, with follow-ups on the dry run, edge cases and complexity.
Technical round 2 (60 minutes, about 30 of them coding)
- Intro, hobbies, how they learn, and projects.
- One medium string problem built on transformations and ASCII logic. The interviewer pushed on test cases and boundary values.
- OS rapid fire: paging, segmentation, cache.
119: longestProfitDuration and stacks vs. queues
Report date: 2025-11-27 · Role: Software Engineer (Internship) · Location: Not stated · Channel: University channel · Result: No offer
Technical round (1 problem)
- Implement longestProfitDuration(prices) for an array such as 10, 7, 12, 9, 2, 11, 8, 1, 2. The report doesn't spell out the exact rules.
- How does a stack differ from a queue?
Resume and HR round
120: Bengaluru — two medium-to-hard DSA rounds
Report date: 2025-11-26 · Role: Software Engineer (Internship) · Location: Bengaluru, India · Result: No offer
Round 1, DSA: two-pointer and linked-list problems (medium to hard).
Round 2, DSA: backtracking and DP problems (medium to hard).
121: India — brackets, a peak, then 105 minutes on projects
Report date: 2025-11-24 · Role: Software Engineer Intern · Location: India · Result: Offer
Technical round (45 minutes)
- Valid Parentheses.
- Find a peak element, then speed it up with binary search.
Projects and leadership round (1 hour 45 minutes)
122: Redmond — two 30-minute technical interviews
Report date: 2025-11-21 · Role: Software Engineer Intern · Location: Redmond, Washington, US · Result: Offer
Two back-to-back 30-minute technical interviews
- Easy and medium coding questions.
- Why do you want to join Microsoft?
123: Redmond — sorting with no extra memory
Report date: 2025-11-20 · Role: Software Engineering Intern · Location: Redmond, Washington, US · Result: Offer
Technical interview
Behavioral interview
- How would you sort a list with no extra memory? Then explain how quicksort works.
About a month to get the interview request and a week to hear back.
124: Belgrade — four OA tasks and a malloc
Report date: 2025-11-19 · Role: Software Engineer (Internship) · Location: Belgrade, Serbia · Result: No offer
Round 1, online test (4 problems: one easy, two medium, one the candidate didn't describe)
Round 2, interview (2 problems)
- Implement malloc.
- A medium DP question they don't remember.
- Basic fit and motivation questions.
125: Cambridge — a surprise resume grill before the coding
Report date: 2025-11-16 · Role: Software Engineer (Internship) · Location: Cambridge, Massachusetts, US · Result: Offer
They skipped to the final. Two coding-assessment links arrived, so the resume grill was a surprise.
Final 1, resume grill (45 minutes)
- Tell me about your resume.
- A time you faced a challenge working in a team.
- Very detailed technical questions about projects and past work.
Final 2, technical (45 minutes, on Codility)
- A medium coding problem.
126: Hyderabad — a DP-heavy OA and a cricket scenario
Report date: 2025-11-14 · Role: SWE Intern · Location: Hyderabad, India · Result: Offer
Online assessment: medium-to-hard DSA with dynamic programming.
Online interview (2 medium DSA questions; they solved one fully and explained the other)
HR round
- Resume, projects and work scenarios, including one built around cricket.
127: Hyderabad — stuck on an anagram question
Report date: 2025-11-12 · Role: Software Intern · Location: Hyderabad, India · Result: No offer
Online assessment (2 medium DSA questions)
Interview round 1
- An anagram question on strings, which they didn't solve.
- Operating systems and networks.
128: Bucharest — three technical rounds, OOP and a linked list
Report date: 2025-11-11 · Role: Software Engineer (Internship) · Location: Bucharest, Romania · Result: Offer
Online assessment
Three back-to-back technical interviews
- OOP principles.
- A linked-list problem.
The candidate got the offer and declined it. They noted the last interview may be about CV and motivation instead of coding.
129: Seattle — a grid DP and linked lists over three interviews
Report date: 2025-11-09 · Role: SWE Intern · Location: Seattle, Washington, US · Result: Offer
Three interviews (about 45 minutes each)
- Minimum-cost path through a grid with dynamic programming.
- Easy-to-medium linked-list questions.
The candidate got the offer and declined it.
130: Bengaluru — graphs, trees and testing basics
Report date: 2025-11-07 · Role: Software Engineer (Internship) · Location: Bengaluru, India · Result: Offer
Interview
- DSA on graphs and binary trees.
- Software testing basics: writing unit tests, black-box vs. white-box testing.
- OS, DBMS, networking and OOP basics.
- Project discussion.
131: Redmond referral program — an engineer, then a PM
Report date: 2025-11-04 · Role: SWE Intern · Location: Redmond, Washington, US · Channel: Referral program · Result: Offer
A referral program let them skip the phone screen.
Final interview 1, with a software engineer, and final interview 2, with a product manager (back to back). Across both:
- Tell me about yourself.
- What's something negative you've done?
- What's the hardest challenge you've overcome?
- One technical question (not described).
132: Bucharest — two technical rounds and a background round
Report date: 2025-11-04 · Role: SWE Intern · Location: Bucharest, Romania · Result: Offer
Online assessment
Three back-to-back interviews: two technical, one behavioral and background
- Isomorphic Strings.
- OOP principles.
The candidate got the offer and declined it.
133: Israel — two coding rounds and a class to implement
Report date: 2025-10-28 · Role: Software Engineer (Internship) · Location: Israel · Result: No offer
Interviews 1 and 2 (coding)
- One asked them to build a data structure.
Interview 3
- Implement a class.
- Questions on a project they built.
134: Paris — stopped at the OA
Report date: 2025-10-22 · Role: Software Engineer Intern · Location: Paris, France · Result: No offer
Online assessment
- Minimum Size Subarray Sum: given positive integers and a target, return the shortest contiguous subarray length whose sum reaches the target, or 0.
They didn't advance past the OA.
135: Serbia — timed OA, three single-problem interviews
Report date: 2025-10-21 · Role: Software Engineer (Internship) · Location: Serbia · Result: No offer
Online assessment (2 timed tasks)
Three interviews (one problem each, a few behavioral questions first)
- A linked-list question and a set question, both around medium.
136: US — 20 minutes on experience, then a medium
Report date: 2025-10-16 · Role: SWE Intern · Location: United States · Result: Offer
Two 45-minute interviews
- The first 20 minutes of each: tell me about your experience and projects.
- A medium coding problem in the second half.
137: Redmond — Dijkstra from scratch
Report date: 2025-10-09 · Role: Software Engineer Intern · Location: Redmond, Washington, US · Result: No offer
Online assessment
Two 45-minute final interviews (one problem each)
- Implement Dijkstra's algorithm from scratch.
- A medium two-pointer string problem the candidate remembered as a variant of finding the longest substring with no repeated characters.
138: Redmond — past experience and a light medium
Report date: 2025-10-09 · Role: Software Engineer Intern · Location: Redmond, Washington, US · Result: Offer
Online assessment
Interviews (behavioral plus coding)
- Tell me about your past experience.
- A medium implementation problem on the easier side.
139: Australia — two same-day interviews
Report date: 2025-10-08 · Role: Software Engineer (Internship) · Location: Australia · Channel: Applied online · Result: Offer
Online assessment
Two interviews on the same day
- Why did you choose Microsoft?
- Algorithm questions in both interviews.
140: Redmond — coding first, then a challenge story
Report date: 2025-10-07 · Role: SWE Intern · Location: Redmond, Washington, US · Result: Offer
Two back-to-back 45-minute interviews
- Coding questions to start each one.
- Describe a time you faced a challenge.
141: Bengaluru off-campus — HackerRank OA and two back-to-back Teams calls
Interview date: October 2025 · Role: Software Engineering Intern · Location: Bengaluru, India · Channel: Careers site · Result: Offer
OA (HackerRank, 2 questions)
- A subarray-counting problem with tricky constraints and edge cases. The report doesn't say which subarrays were counted.
- A problem best solved with DP.
Two technical interviews, same day (Microsoft Teams, about 35–40 minutes each, with 2–3 hours between them while the recruiter confirmed the next step). The candidate described them together:
- Memory hierarchy, types of memory, computer architecture, and kinds of programming languages.
- DSA on linked lists, hash maps, arrays, strings and DP.
- A full-stack project deep dive: frontend and backend architecture and the choices behind it.
- A tiny program to check whether a number is divisible by 5. The candidate took it as a check on readable code, not on logic.
A lot of the time went to the interviewers talking about their own work on cloud and systems. The offer came about a week later.
142: Cairo — a suffix-sum OA and some ML questions
Report date: October 2025 · Role: Software Engineer (Internship) · Location: Cairo, Egypt · Result: No offer
Online assessment
- A suffix-sum question (the candidate doesn't remember it exactly).
Interview
- Basic OOP and DSA questions, plus some machine learning questions.
143: Redmond — strings, trees, and a heavy resume grill
Interview date: October 2025 (final round) · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: Offer
They applied in mid-August, took the OA in early September, got the final invite about a week later, and had the final in early October.
Online assessment
Two 45-minute final interviews
- String manipulation: reversing and splitting.
- Binary trees and BFS.
- A heavy resume grill.
144: Bengaluru — a water-storage problem, brute force to optimal
Report date: October 2025 · Role: SDE-intern · Location: Bengaluru, India · Result: No offer
Online assessment: simple DSA questions.
Interview round 1 (about 30 minutes)
- A water-storage problem about buildings. They went from brute force to the optimal approach. The report doesn't give enough to tell whether it was Trapping Rain Water or a container-style problem.
Rejected after this round.
145: Bucharest — three finals and an LCS
Report date: October 2025 · Role: SWE Intern · Location: Bucharest, Romania · Result: No offer
Online assessment
Three back-to-back 45-minute finals, three weeks after the OA
146: Redmond — a design round, then Top K Frequent
Report date: October 2025 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: No offer
Online assessment two weeks after applying; interviews two weeks after that.
Technical interview 1: a system design question.
Technical interview 2: Top K Frequent Elements.
147: Dublin — a behavioral assessment and a three-hour final
Report date: October 2025 · Role: Software Engineer (Internship) · Location: Dublin, Ireland · Result: No offer
Online assessment (HackerRank, 2 problems: one easy, one medium-to-hard DP)
Behavioral assessment
Final (3 hours with three interviewers, behavioral plus technical)
148: Redmond — OA with debugging, then min-max heaps
Report date: October 2025 · Role: Software Engineer Intern · Location: Redmond, Washington, US · Result: Offer
Online assessment: data structures, algorithms and debugging.
Technical interview
Two back-to-back final interviews
- How to work with min-max heaps.
- System design basics and behavioral questions.
149: Dublin referral — OA and three virtual interviews
Report date: October 2025 · Role: Software Engineer (Internship) · Location: Dublin, Ireland · Channel: Referral · Result: Offer
Online assessment (2 problems: one medium, one hard)
Three virtual interviews
- Two easy coding questions.
- A basic system design question about their own project.
Common questions
Does Microsoft ask CS fundamentals in SWE intern interviews?
In this part, 13 of 47 reports did: OS, OOP and DBMS questions, or concepts such as how a doubly linked list works or how a negative number is stored in binary.
Keep practicing
- Practice problems from reports 103–149, with the report numbers they came from: LRU Cache (106); Reverse Nodes in k-Group (112); Integer square root (113); Validate Binary Search Tree (113); Longest Increasing Subsequence (114); Implement a trie (114); Map with O(1) get, set and setAll (116); Longest buy-to-sell span with a profit (119); Valid Parentheses (121); Find Peak Element (121); Implement malloc and free over a fixed buffer (124); Minimum-cost path through a grid (129); Isomorphic Strings (132); Minimum Size Subarray Sum (134); Implement Dijkstra's algorithm from scratch (137); Longest Common Subsequence (145); Top K Frequent Elements (146).
- Microsoft system design questions and Microsoft behavioral questions: the company question banks (sign-in needed).
- Microsoft interview page: Microsoft practice grouped by reported stage.
- Microsoft hiring insights: OA and interview insights for Microsoft.
- Experience feed: more interview reports and roundups.
In this series: Part 1 · Part 2 · Part 3 (current) · Part 4 · Part 5 · Part 6
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.