Glassdoor users rated their interview experience at Volmint Technologies as 100% positive with a difficulty rating score of 2.5 out of 5 (where 5 is the highest level of difficulty). Candidates interviewing for Software Engineer and SEO Content Writer rated their interviews as the hardest, whereas interviews for Software Engineer and SEO Content Writer roles were rated as the easiest.
I applied online. I interviewed at Volmint Technologies (New Delhi) in Jun 2021
Interview
Application: Start by submitting your resume and any other required application materials through the company's job portal or website. Technical Interview(s): Technical Phone/Video Interview: You have a technical interview with an engineer or a technical lead. They could ask you coding, algorithmic, or system design questions to assess your technical skills. HR Interview: A final interview with HR conducted to discuss compensation, benefits, and any other logistical details. Offer: If the company is satisfied with your performance in the interviews, they will extend a job offer.
Interview questions [1]
Question 1
About the Algorithms in coding and logic's behind the programming we use . I would Like to share some question examples like Reverse a String: Write a function that reverses a given string in-place. Palindrome Check: Determine whether a given string is a palindrome (reads the same forwards and backwards). FizzBuzz: Print numbers from 1 to n, but for multiples of 3, print "Fizz," for multiples of 5, print "Buzz," and for multiples of both 3 and 5, print "FizzBuzz." Merge Sort: Implement the merge sort algorithm to sort an array of integers. Binary Search: Implement the binary search algorithm to find the index of a target element in a sorted array. Linked List Cycle Detection: Determine if a given linked list has a cycle and return the starting node of the cycle if present. Longest Substring Without Repeating Characters: Find the length of the longest substring without repeating characters in a given string. Maximum Subarray: Find the contiguous subarray within an array that has the largest sum. Find Missing Number: Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. Valid Parentheses: Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. Knapsack Problem: Given a set of items, each with a weight and a value, determine the maximum value that can be obtained by selecting a subset of the items that fit into a knapsack of limited capacity.