Intuit Interview Questions, Process, and Tips

Program to insert an element into a sorted linked list

• Traverse the linked list until the correct position is found

• Create a new node with the element to be inserted

• Adjust the pointers of the previous and next nodes to point to the new node

• Handle edge cases such as inserting at the beginning or end of the list

Program to delete a node in a singly linked list given only a pointer to the node to be deleted

• Copy the data from the next node to the current node and delete the next node

• Update the pointer of the current node to point to the next node's next node

• Handle edge cases where the node to be deleted is the last node in the list

Find repeating numbers in an array of n elements containing numbers from 0 to n-1 in O(n) time and constant memory space.

• Create an empty result array.

• Iterate through the array and for each element, take its absolute value and subtract 1 from it.

• If the element at the new index is positive, make it negative.

• If it is already negative, add the original element to the result array.

• Return the result array.

The virtual keyword is used in C++ for creating virtual functions and implementing polymorphism.

• Used to create virtual functions that can be overridden by derived classes

• Allows for dynamic binding of functions at runtime

• Used in implementing polymorphism

• Can be used with multiple inheritance to resolve ambiguity

• Example: virtual void functionName() = 0; creates a pure virtual function

Developed a mobile app for tracking daily water intake

• Used React Native to build the app

• Integrated a database to store user data

• Implemented push notifications to remind users to drink water

• Designed a user-friendly interface with intuitive features

C is a procedural language, C++ is an object-oriented language, and Java is a class-based object-oriented language.

• C is a low-level language used for system programming and embedded systems.

• C++ is an extension of C with added features like classes, inheritance, and polymorphism.

• Java is platform-independent and has automatic memory management through garbage collection.

• Java programs run on a virtual machine, while C and...read more

I am interested in working with web apps.

• Web apps have a wider reach and are more accessible.

• They can be accessed from anywhere with an internet connection.

• Web apps are easier to update and maintain.

• Examples: Facebook, Google Docs, Amazon

Web 2.0 is more interactive and user-generated content-driven, while Web 1.0 was static and read-only.

• Web 2.0 allows for social networking and collaboration, while Web 1.0 was primarily informational.

• Web 2.0 relies on user-generated content, while Web 1.0 was created by developers and publishers.

• Web 2.0 is more dynamic and responsive, while Web 1.0 was static and slow to load.

• Examples of Web 2.0 sites include Facebook,...read more

IAAS, PAAS, and SAAS are different cloud computing models that offer varying levels of control and management to users.

• IAAS (Infrastructure as a Service) provides users with access to virtualized computing resources such as servers, storage, and networking. Users have complete control over the infrastructure and are responsible for managing it.

• PAAS (Platform as a Service) provides users with a platform to develop, run,...read more

Program to calculate total number of valid words possible from a given word and dictionary

• Create a hash table of dictionary words

• Generate all possible permutations of the given word

• Check if each permutation is a valid word in the hash table

• Return the count of valid words

Program to find GCD of a set of numbers using Euclid's algorithm.

• Take two numbers and find their GCD using Euclid's algorithm.

• Repeat the process for all numbers in the set.

• The final GCD will be the GCD of the entire set.

• Use recursion to simplify the code.

• If any number is 0, return the other number as GCD.

Design optimal data structures for LRU cache

• Use a doubly linked list to keep track of recently used items

• Use a hash table to store key-value pairs for quick access

• When an item is accessed, move it to the front of the linked list

• When the cache is full, remove the least recently used item from the back of the linked list and hash table