GuideCareer
10 min read
Interviewers in a live coding round are judging how you think as much as whether your code runs. This article describes the technical rounds freshers meet at different kinds of employers, a six-step method for any coding problem, what useful thinking aloud sounds like, how to recover when stuck, how to handle take-home assignments, fundamentals and project deep-dives, and how to practise with AI as a reviewer.
GuideCareer
9 min read
When an assessment link arrives, you usually have a few days. This article shows how to find out what a specific company's assessment tends to contain from candidate reports, how to read those reports sceptically and synthesise them with AI, how to prepare for aptitude sections, and a 48-hour plan, a 24-hour plan and a day-of routine that put your remaining time where it counts.
GuideCareer
10 min read
Solving hundreds of random problems is a slow way to get good at assessments. Learning to recognise the pattern behind a problem is faster. This article sets out which patterns matter most for fresher assessments, a practice loop with a hint ladder, how to set up an AI assistant as a Socratic coach that never hands you the answer, an error log, timed contests, and a weekly plan.
GuideCareer
10 min read
Knowing algorithms is half of an online assessment. The other half is strategy: reading all problems first, using the constraints to tell you the complexity you need, capping time per problem, submitting a working brute force before optimising, collecting partial marks, and testing edge cases before the hidden tests do. Includes a stress-testing technique for practice, with a short program.
GuideCareer
9 min read
For most off-campus candidates the online assessment, not the interview, is where the search stops. This article explains the kinds of assessments freshers face in India, the platforms that host them and how their editors and scoring differ, what proctoring typically monitors, why using AI or notes against the rules is a serious risk, and a set-up checklist so nothing technical costs you marks.
GuideTechnology
19 min read
How to prepare for campus placements and fresher hiring in India: aptitude rounds, online coding assessments with fast input and output, technical interviews, CS fundamentals, explaining trade-offs, debugging under pressure and discussing projects honestly.
GuideTechnology
18 min read
A realistic week-by-week plan for working through this course around college or a job: what to learn, implement, practise and revise each week, with timed sessions, mock interviews, a spaced-revision schedule, and lighter and more intensive alternatives.
GuideTechnology
24 min read
Build a small, complete Java project that uses many data structures together: a practice tracker with spaced-repetition reviews, undo, title autocomplete and a prerequisite-based study order. Requirements, design, milestones, test cases and extension ideas, with no paid services.
GuideTechnology
23 min read
A step-by-step routine for coding interviews: clarify, work examples, state a brute force, optimize, agree on a plan, code, test and analyze. Includes a full sample dialogue, advice on getting unstuck, and checklists you can use in mock interviews.
GuideTechnology
22 min read
What to do when prefix sums are not enough: Fenwick and segment trees for range queries with updates (optional depth), and disjoint set union with path compression and union by size for connectivity, cycles and Kruskal's algorithm (the part worth knowing).
GuideTechnology
19 min read
A trie stores words so that shared prefixes share nodes, making insert, exact search and prefix search take time proportional to the word length. Build one in Java, compare array and map nodes, and use it for autocomplete, wildcards and shortest-prefix replacement.
GuideTechnology
21 min read
Apply the six-step DP workflow to climbing stairs, house robber, grid paths and the longest common subsequence. For each: state, transition, base cases, evaluation order, complexity and why it is correct, with full tables and reconstruction.
GuideTechnology
20 min read
Dynamic programming is recursion that remembers. Learn overlapping subproblems and optimal substructure, memoization and tabulation on Fibonacci, a repeatable six-step formulation workflow, and the coin change problem that greedy cannot solve.
GuideTechnology
24 min read
When BFS is enough and when it is not, Dijkstra's algorithm with a priority queue and its non-negative-weight limit, a glance at Bellman-Ford, and topological sorting with Kahn's algorithm and DFS for dependency order, including how to detect impossible orders.
GuideTechnology
24 min read
Vertices and edges, adjacency lists versus matrices, breadth-first and depth-first search, connected components, grids as graphs, and basic cycle detection in undirected and directed graphs, with complexity in terms of V and E.
GuideTechnology
20 min read
Binary numbers, the bitwise operators and Java's signed-integer behaviour, then the reasoned uses: parity, powers of two, counting bits, XOR, masks and subsets, plus GCD, modular arithmetic, fast exponentiation and the sieve of Eratosthenes.
GuideTechnology
22 min read
When picking the best-looking option at every step is actually correct, and when it is not. Learn to justify a greedy strategy, hunt for counterexamples, and solve activity selection, merge intervals, meeting rooms and jump game.
GuideTechnology
19 min read
Answer range-sum queries in constant time with a running-total array, count subarrays with a given sum using a hash map, compute product-except-self, handle 2D regions, and apply many range updates at once with a difference array.
