i
Pattem Digital Technologies
Filter interviews by
I applied via Walk-in and was interviewed in Feb 2024. There were 2 interview rounds.
Mostly about comprashensive topics, situation handling questions and apptiture based on %,time,match pattern
Coding based on string manupulation
I applied via Job Portal and was interviewed in Feb 2024. There were 2 interview rounds.
Basic string array questions along with personality analyses
Basic of Javascript, async await , hoisting
posted on 19 Dec 2024
I applied via Campus Placement
It was good 20 mcqs 3 coding questions
2 Leetcode Medium questions on hackerrank
I applied via Campus Placement
Aptitude was including both MCQs and Input
Python is a high-level, interpreted language known for its simplicity and readability, while C is a low-level, compiled language known for its speed and efficiency.
Python is dynamically typed, while C is statically typed.
Python has automatic memory management, while C requires manual memory management.
Python is platform-independent, while C is platform-dependent.
Python is commonly used for web development and data anal...
C is faster than Python due to its lower-level nature and direct hardware access.
C is a compiled language, while Python is an interpreted language.
C code is directly translated into machine code, while Python code is executed line by line.
C has direct access to hardware, while Python relies on external libraries for such access.
A program to count vowels in a given name
Create a function that takes a string as input
Loop through each character in the string and check if it is a vowel (a, e, i, o, u)
Increment a counter for each vowel found
Return the total count of vowels
Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into smaller sub-arrays.
Choose a pivot element from the array
Partition the array into two sub-arrays based on the pivot element
Recursively apply quick sort to the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Implement a linked list data structure in a programming language.
Create a Node class with data and a reference to the next node
Implement methods to add, remove, and search for elements in the linked list
Handle edge cases like adding to an empty list or removing the last element
Operations on Linked list include insertion, deletion, traversal, and searching.
Insertion: Add a new node at the beginning, end, or middle of the linked list.
Deletion: Remove a node from the linked list based on a given key or position.
Traversal: Visit each node in the linked list to perform operations or display data.
Searching: Find a specific node in the linked list based on a given key or value.
I applied via Approached by Company and was interviewed in Jan 2024. There were 2 interview rounds.
1 hour - Find longest palindromic substring
I applied via Referral and was interviewed in Sep 2023. There were 3 interview rounds.
60 Minutes coding test was there
Traverse the linked list and add the values of each node without using additional data structures.
Traverse the linked list while keeping track of the sum in a variable
Update the sum by adding the value of each node as you traverse the list
Handle carry over if the sum of two nodes is greater than 9
To find all subsets of a given set, use recursion to generate all possible combinations.
Use recursion to generate all possible combinations of including or excluding each element in the set.
Start with an empty subset and recursively add each element to create new subsets.
Each subset can be represented as an array of strings.
LRU Cache is a data structure that stores a fixed number of items and removes the least recently used item when the cache is full.
LRU Cache uses a combination of a doubly linked list and a hashmap to efficiently store and retrieve items.
When an item is accessed, it is moved to the front of the linked list to indicate it is the most recently used item.
If the cache is full, the least recently used item at the end of the ...
It was 30min tests including 15 multiple choice and 5 coding questions on Java and Automation
Sanity testing is a subset of regression testing that focuses on testing the most crucial functionalities of a software application.
Sanity testing is a quick and shallow testing of the main functionalities of an application to ensure it is stable enough for further testing.
It is usually performed after major changes in the codebase to check if the core features are working as expected.
Sanity testing is not exhaustive a...
Senior Software Engineer
4
salaries
| ₹14.5 L/yr - ₹25 L/yr |
Lead Engineer
3
salaries
| ₹22 L/yr - ₹28 L/yr |
Content Writer
3
salaries
| ₹2.2 L/yr - ₹3.4 L/yr |
Lead Software Engineer
3
salaries
| ₹29 L/yr - ₹31 L/yr |
SEO Executive
3
salaries
| ₹3.2 L/yr - ₹3.2 L/yr |
TCS
Infosys
Wipro
HCLTech