• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

strtok()

March 21, 2014 by Dhaval Dave

Function Strtok

char * strtok ( char * str, const char * delimiters );
What it does : Split string into tokens
A sequence of calls to this function split str into tokens,
which are sequences of contiguous characters separated by any of
the characters that are part of delimiters

Example

/* strtok example */


int main ()
{
  char str[] ="This-is Go,Hired Site.";
  char * pch;
  printf ("Splitting string "%s" into tokens:n",str);
  printf ("--------");
  pch = strtok (str," ,.-"); // ',' '.' and '-' will be removed
  while (pch != NULL)
  {
    printf ("%sn",pch);
    pch = strtok (NULL, " ,.-");
  }
  return 0;
}
Output:
Splitting string “This-is Go,Hired Site.” into tokens:
——–
This is Go Hired Site

Similar Articles

Filed Under: problem Tagged With: Array, string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Trie Dictionary

Closed Parentheses checker

Wrong Directions given find minimum moves so that he can reach to the destination

LeetCode : Word Search

Trapping Rain Water

Find and print longest consecutive number sequence in a given sequence in O(n)

Check Binary Tree is Binary Search Tree or not

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Maximum of all subarrays of size k

Skiing on Mountains Matrix

Add Sub Multiply very large number stored as string

Mirror of Tree

Level order traversal in Spiral form

C++ OOPs Part1

Length of the longest substring without repeating characters

K’th Largest Element in BST when modification to BST is not allowed

Implement LRU Cache

SAP Hiring Off-Campus General Aptitude

SAP Off Campus Hiring_ March 2015 Sample Questions

Facebook Interview Question : Interleave List

Adobe Interview Questions 8 month Exp

Stickler thief

Reliance Jio Software Developer Interview Experience

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Generic Object Oriented Stack with Template

Sort Stack in place

Reversal of LinkedList

Search element in a matrix with all rows and columns in sorted order

Copyright © 2026 · Genesis Framework · WordPress · Log in