Learn how students cracked internships and placements through detailed interview experiences, preparation tips and insights.
# KalkiTech Graduate Engineer Recruitment Experience – 2026 I recently attended the KalkiTech recruitment assessment as part of the campus hiring process. The assessment consisted of 27 multiple-choice questions and 2 coding questions. ## Assessment Pattern The first section consisted of 27 MCQs covering quantitative aptitude, logical reasoning, probability, percentages, profit and loss, compound interest, data interpretation, calendars, puzzles, and logical arrangement problems. Some of the questions I remember included: - A word arrangement question involving grouping vowels together and finding the maximum number of possible arrangements. - A sales tax and percentage-based problem. - A probability question involving red, yellow, and blue balls selected randomly from a bag. - A profit, cost price, marked price, and discount problem. - A percentage problem involving P and Q. - A compound interest problem with quarterly compounding. - A bar graph/data interpretation question. - A number puzzle involving three circles divided into halves. - A logical friendship/relationship problem. - Calendar and day-of-the-week questions. - A problem involving people, professions, relationships, and marriage conditions. There was also a programming-related conceptual question about JavaScript modules and exports. The question tested the difference between named and default exports and how functions can be exposed while keeping internal helper functions private. ## Coding Questions There were 2 coding questions. ### Coding Question 1 – Array / Target Reduction Given a sequence of numbers and a target value, elements can be removed only from the beginning or the end of the sequence. Each removed element decreases the target by its value. The task was to find the minimum number of removal operations required to make the target exactly zero. If it is impossible, the result should be -1. This problem can be approached using prefix sums, sliding window, or related array techniques. ### Coding Question 2 – Grid Minimum Maximum Strain A rectangular grid contains numerical values representing stability ratings. Movement is allowed up, down, left, or right. The cost of moving between two adjacent cells is the absolute difference between their values. Starting from the top-left cell, the goal is to reach any cell in the bottom row while minimizing the maximum movement cost encountered along the route. After finding the minimum possible maximum strain, a fixed value of 2 must be added to the result. This is essentially a minimum-bottleneck path problem on a grid and can be solved using approaches such as Dijkstra's algorithm with a minimax distance, binary search with graph traversal, or related graph techniques. I would rate the assessment as Medium. The aptitude section required good time management because it included a mixture of quantitative, logical, and puzzle-based questions. The coding questions required understanding the underlying problem rather than simply applying basic syntax. For candidates preparing for a similar Kalkitech assessment, I would recommend focusing on: - Percentages, profit and loss, simple and compound interest - Probability - Data interpretation - Calendar and logical reasoning problems - Puzzles and arrangement questions - Arrays and prefix sums - Sliding window - Hashing - Graph and grid problems - Basic SQL and DBMS - OOP concepts - Operating Systems - Programming fundamentals This experience is based on the questions I personally remember from the assessment. The wording of the questions above has been paraphrased rather than reproduced from an assessment paper.
# KalkiTech Graduate Engineer Recruitment Experience – 2026 I recently attended the KalkiTech recruitment assessment as part of the campus hiring process. The assessment consisted of 27 multiple-choice questions and 2 coding questions. ## Assessment Pattern The first section consisted of 27 MCQs covering quantitative aptitude, logical reasoning, probability, percentages, profit and loss, compound interest, data interpretation, calendars, puzzles, and logical arrangement problems. Some of the questions I remember included: - A word arrangement question involving grouping vowels together and finding the maximum number of possible arrangements. - A sales tax and percentage-based problem. - A probability question involving red, yellow, and blue balls selected randomly from a bag. - A profit, cost price, marked price, and discount problem. - A percentage problem involving P and Q. - A compound interest problem with quarterly compounding. - A bar graph/data interpretation question. - A number puzzle involving three circles divided into halves. - A logical friendship/relationship problem. - Calendar and day-of-the-week questions. - A problem involving people, professions, relationships, and marriage conditions. There was also a programming-related conceptual question about JavaScript modules and exports. The question tested the difference between named and default exports and how functions can be exposed while keeping internal helper functions private. ## Coding Questions There were 2 coding questions. ### Coding Question 1 – Array / Target Reduction Given a sequence of numbers and a target value, elements can be removed only from the beginning or the end of the sequence. Each removed element decreases the target by its value. The task was to find the minimum number of removal operations required to make the target exactly zero. If it is impossible, the result should be -1. This problem can be approached using prefix sums, sliding window, or related array techniques. ### Coding Question 2 – Grid Minimum Maximum Strain A rectangular grid contains numerical values representing stability ratings. Movement is allowed up, down, left, or right. The cost of moving between two adjacent cells is the absolute difference between their values. Starting from the top-left cell, the goal is to reach any cell in the bottom row while minimizing the maximum movement cost encountered along the route. After finding the minimum possible maximum strain, a fixed value of 2 must be added to the result. This is essentially a minimum-bottleneck path problem on a grid and can be solved using approaches such as Dijkstra's algorithm with a minimax distance, binary search with graph traversal, or related graph techniques. I would rate the assessment as Medium. The aptitude section required good time management because it included a mixture of quantitative, logical, and puzzle-based questions. The coding questions required understanding the underlying problem rather than simply applying basic syntax. For candidates preparing for a similar Kalkitech assessment, I would recommend focusing on: - Percentages, profit and loss, simple and compound interest - Probability - Data interpretation - Calendar and logical reasoning problems - Puzzles and arrangement questions - Arrays and prefix sums - Sliding window - Hashing - Graph and grid problems - Basic SQL and DBMS - OOP concepts - Operating Systems - Programming fundamentals This experience is based on the questions I personally remember from the assessment. The wording of the questions above has been paraphrased rather than reproduced from an assessment paper.
I'm happy to share my experience. Overall, the interview process was quite straightforward and I'm thrilled to say that I was selected for FTE role! # Part 1 — General Aptitude This section included: • Time & Work • Basic arithmetic • Ratio & Proportion • Other standard aptitude topics The questions were easy but time-consuming, so speed and pre-practice matter a lot. ⸻ # Part 2 — Numerical Aptitude This round was more focused on numerical reasoning, including: • AP (Arithmetic Progression) • GP (Geometric Progression) • Sum of n terms • Number-based logical calculations ### Difficulty was moderate, but again the time limit makes it challenging. Practicing these topics beforehand helps a lot. ⸻ # Part 3 — English (Vocabulary + Grammar) This section was: • The toughest among all three • Focused on advanced vocabulary, grammar correction, sentence improvement, and comprehension Good command of English is helpful, and practicing vocabulary + grammar exercises is recommended. ⸻ # Important Note: Time Management All three rounds had a strict time limit, so: • Practicing general aptitude regularly is essential • Platforms like Indiabix can help improve speed and accuracy
I'm happy to share my experience. Overall, the interview process was quite straightforward and I'm thrilled to say that I was selected for FTE role! # Part 1 — General Aptitude This section included: • Time & Work • Basic arithmetic • Ratio & Proportion • Other standard aptitude topics The questions were easy but time-consuming, so speed and pre-practice matter a lot. ⸻ # Part 2 — Numerical Aptitude This round was more focused on numerical reasoning, including: • AP (Arithmetic Progression) • GP (Geometric Progression) • Sum of n terms • Number-based logical calculations ### Difficulty was moderate, but again the time limit makes it challenging. Practicing these topics beforehand helps a lot. ⸻ # Part 3 — English (Vocabulary + Grammar) This section was: • The toughest among all three • Focused on advanced vocabulary, grammar correction, sentence improvement, and comprehension Good command of English is helpful, and practicing vocabulary + grammar exercises is recommended. ⸻ # Important Note: Time Management All three rounds had a strict time limit, so: • Practicing general aptitude regularly is essential • Platforms like Indiabix can help improve speed and accuracy
# Your Ultimate Guide to the Infosys 2025 On-Campus Drive Infosys is coming to campus! This guide, compiled by the PrepLinc team with insights from students at IIT Palakkad, covers everything you need to know about the Online Test for the role like Specialist Programmer (SP) and Digital Specialist Engineer (DSE). ## Test Structure & Format The test is typically conducted on the Infosys assessment platform and consists of three sections. The total duration is approximately 100 minutes. - **Section 1: Mathematical Ability & Reasoning (25 mins):** This section tests your logical and quantitative skills. Expect questions on puzzles, data interpretation, and pattern recognition. Time management is key here. - **Section 2: Technical Ability (35 mins):** A multiple-choice section covering core CS fundamentals. Key topics include Data Structures, Algorithms (especially complexity analysis), OOPs concepts, DBMS, and basic Operating Systems knowledge. - **Section 3: Coding (40 mins):** This is the most crucial section, containing two coding problems. Typically, one is of easy-medium difficulty (often array or string-based) and the second is a medium-hard problem (often involving Dynamic Programming, Graphs, or complex data structures like Heaps). # Key Takeaways & Strategy Based on recent experiences, a strong performance in the coding section is vital. Aim to solve at least one question completely and make significant progress on the second. Don't neglect the technical MCQ section, as it often acts as a tie-breaker. ### Good luck with your preparation!
# Your Ultimate Guide to the Infosys 2025 On-Campus Drive Infosys is coming to campus! This guide, compiled by the PrepLinc team with insights from students at IIT Palakkad, covers everything you need to know about the Online Test for the role like Specialist Programmer (SP) and Digital Specialist Engineer (DSE). ## Test Structure & Format The test is typically conducted on the Infosys assessment platform and consists of three sections. The total duration is approximately 100 minutes. - **Section 1: Mathematical Ability & Reasoning (25 mins):** This section tests your logical and quantitative skills. Expect questions on puzzles, data interpretation, and pattern recognition. Time management is key here. - **Section 2: Technical Ability (35 mins):** A multiple-choice section covering core CS fundamentals. Key topics include Data Structures, Algorithms (especially complexity analysis), OOPs concepts, DBMS, and basic Operating Systems knowledge. - **Section 3: Coding (40 mins):** This is the most crucial section, containing two coding problems. Typically, one is of easy-medium difficulty (often array or string-based) and the second is a medium-hard problem (often involving Dynamic Programming, Graphs, or complex data structures like Heaps). # Key Takeaways & Strategy Based on recent experiences, a strong performance in the coding section is vital. Aim to solve at least one question completely and make significant progress on the second. Don't neglect the technical MCQ section, as it often acts as a tie-breaker. ### Good luck with your preparation!
🎉 You've explored the whole map! Help us expand it by contributing your own story or inviting a friend.
